Skip to content

problem1.md

Latest commit

 

History

History
14 lines (10 loc) · 598 Bytes

problem1.md

File metadata and controls

14 lines (10 loc) · 598 Bytes

Problem 1: The Queen's Dominion (N-Queens)

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. Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space, respectively.

Input Format

  • An integer n.

Constraints

  • 1 <= n <= 9

Example

Input: n = 4
Output: [[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]