in the solution of n-queen using bitset how is the time compexity 1/n times of normal backtracking solution?
complexity using bitmasking is O(N)
