52. N-Queens II

Hard

3.2K

241

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*.

**Example 1:**

Input:n = 4Output:2Explanation:There are two distinct solutions to the 4-queens puzzle as shown.

**Example 2:**

Input:n = 1Output:1

**Constraints:**

`1 <= n <= 9`

Accepted

304.4K

Submissions

425.3K

Acceptance Rate

71.6%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved