Time complexity of N-Queen Problem

#1

Can you please explain how the time complexity of N Queen problem using backtracking is O(N^N)

#2

Hello @gaganwalia212 the time compleity of n queen algorithm can be roughly scene as O(n!)=O(n* n-1* n-2*…* 2* 1) .

#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.