solulubeta
Sign in
NeetCode 150 / Backtracking
10.09 · Problem

N-Queens

Hard Row-by-row backtracking with conflict sets 1 video LC 51 Pro

This problem is part of solulu Pro

Place n queens on an n × n chessboard so that no two attack each other (no shared row, column or diagonal). Return every distinct board, in any order, where each board is a list of strings with Q for a queen and . for…

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 79 of 150 · updated 2026-10-12