N - Queens Problem

Problem Statement We have to place N number of queens in a NxN matrix, such that no 2 queens cross each other's path in any way. This Problem is to be solved using Recursion and Backtracking. It is really similar to N - Knights Problem Ways for a Q...