leaps.ggTRACK YOUR MASTERY →
PROBLEMS/BACKTRACKING/CONSTRAINT SATISFACTION (N-QUEENS)

Constraint Satisfaction (N-Queens) Problems

9 Constraint Satisfaction (N-Queens) problems on LeetCode, a Backtracking interview pattern, ranked by importance (how often it comes up in real interviews). Difficulty (ELO) and importance shown per problem.

#PROBLEMDIFFELOIMPPATTERNS
1N-QueensMedium169782
Matrix Traversal (Diagonal, Valid Sudoku, etc)
2N-Queens IIMedium166768
General Bit Manipulation
3Sudoku SolverHard187262
Matrix Traversal (Diagonal, Valid Sudoku, etc)
4Construct the Lexicographically Largest Valid SequenceHard208045
General Greedy (Greedy is main insight)
5Flip Game IIPREMIUMMedium176838
Linear Recurrence DP · General Math
+ 4 more Constraint Satisfaction (N-Queens) problems, see all in the explorer →
MORE BACKTRACKING PATTERNS
PermutationsCombinations / SubsetsConstraint Satisfaction (N-Queens)String Partitioning (Palindrome Partitioning)Path Finding with Backtracking
// your mastery
Bronze tier crystalSilver tier crystalGold tier crystalPlatinum tier crystalDiamond tier crystal
What's your Constraint Satisfaction (N-Queens) tier?

leaps.gg syncs your LeetCode history, scores your Constraint Satisfaction (N-Queens) mastery, and recommends exactly which problems to do next with spaced repetition. Free to start.

GET MY MASTERY MAP →