Nqueens Combinations - 2d As 1d - Queen Chooses

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

1. You are given a number n, representing the size of a n * n chess board.
2. You are required to calculate and print the combinations in which n queens can be placed on the
n * n chess-board.
3. No queen shall be able to kill another.

Note -> Use the code snippet and follow the algorithm discussed in question video. The judge can't
force you but the intention is to teach a concept. Play in spirit of the question.
Input Format
A number n
Output Format
Check the sample output and question video
Question Video
Constraints
1 <= n <= 5
Sample Input
4
Sample Output
-	q	-	-	
- - - q
q - - -
- - q -

- - q -
q - - -
- - - q
- q - -



  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name