Problem Statement

Here$$s a Java problem that involves nested loops, arrays, and recursion. This program will solve the N$-$Queens problem, a classic example of using these concepts together.

Write a Java program to solve the N$-$Queens problem. The N$-$Queens problem is about placing N queens on an N$\backslash$times N chessboard such that no two queens threaten each other. This means no two queens can be in the same row, column, or diagonal.

Example

For N $=4,$ one of the possible solutions is:

$.$ Q $..$

$...$ Q

Q $...$

$..$ Q $.$