Leetcode 51. N-Queens
Place n queens on an n×n chessboard so no two queens share a row, column, or diagonal, and return all distinct board configurations. This is a classic combinatorial search / backtracking problem that explores permutations with diagonal pruning (n ≤ 9).
Asked at:
N
Netapp
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early June, 2026
N
Netapp
Senior
Place n queen in nxn chessboard
Hello Interview Premium
Your account is free and you can post anonymously if you choose.