Solution of n Queens problem.There r some redundancies right now
A better implementation,slight improvement.I feel that I only need 2 choose the queen's position in d next row and everything happens recursively.I have already covered the case when there is queen in 3rd row(though in my case it was d 3rd queen 2 b placed but I might have 2 place 2nd queen in 3rd row nd 3rd queen in 2nd row).It doesn't give any different solution