← Prev

N Queens

Hard Backtracking

Place n queens on an n x n board so none attack each other; return all solutions.

Full statement, examples and constraints: see the original problem link below.

View original problem ↗

A full in-site walkthrough for this problem is coming soon.

View solution & discussion on the original problem ↗

Write your solution in the editor, then hit “Mark solved”. In-browser run & auto-check is coming soon.