Dought regarding time complexity

#1

What is the time complexity of this algorithm, can we solve it for n=15 , in 1 sec or within hackerblock time limit.

#2

Hello @anand_54 generally the time complexity for n queen is n! in worst case . but yes it depends on the implementation as well.
i think you cant do for n=15 because i have just checked it is giving error for this:
may be in offline ide you can do:
Happy Learning!!

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.