Leetcode 52. N-Queens II
Count the number of distinct ways to place n queens on an n×n chessboard so that no two attack each other; solve by exploring valid queen placements with backtracking/DFS (commonly optimized using bitmasks) — n ≤ 9.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.