Practice N-Queens

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#51

LeetCode Problem

N-Queens

Array Backtracking

Problem Statement

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 all distinct solutions to the n-queens puzzle. You may return the answer in any order. Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space, respectively.

Source: N-Queens on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

n = 4

Output

[[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]

# Example 2

Input

n = 1

Output

[["Q"]]

Constraints

1 <= n <= 9

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free