48. N-Queens II

HardBacktracking

The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return the number of distinct solutions to the n-queens puzzle.

Examples

Input: 4

Output: 2

Explanation: There are 2 distinct non-attacking arrangements on a 4x4 board.

Constraints

  • 1 <= n <= 9
Loading...

Run checks all cases above. Submit evaluates all test cases.