#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/pattern-22/backtracking/n-queens-problem-statement

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/pattern-22/backtracking/n-queens-problem-statement

Repovive

LeetCode 51 N-Queens - Problem Statement - Backtracking | Pattern 22: LeetCode Interview Patterns | Repovive

Repovive.

LeetCode 51 N-Queens - Problem Statement

The problem

2 min

Place $n$ n queens on an $n \times n$ n×n chessboard so no two queens attack each other.

Queens attack horizontally, vertically, and diagonally.

For $n = 4$ n=4, one solution:

. Q . .
. . . Q
Q . . .
. . Q .

Return all distinct solutions. Each solution is a board configuration.

Constraints: $1 \le n \le 9$ 1≤n≤9.