Matrix problem solved with backtracking 1. Take as input N,the size of a chess board 2. We are asked to place N number of queens in it 3. No queen can kill each other 4. Write a recursive function which prints all valid configurations 5. Void is the return type for function
Input Format
input id handled for you.This is a functional problem String will be input
Output Format
Each output in next line
Constraints
1 <= N <= 50