Laxman Kumar laxmankumar2000
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* | |
| You are given an empty chess board of size N*N. Find the number of ways to place N queens on the board, such that no two queens can kill each other in one move. A queen can move vertically, horizontally and diagonally. | |
| Input Format | |
| A single integer N, denoting the size of chess board. | |
| Constraints | |
| 1<=N<=11 |
OlderNewer