Which optimized recursion/backtracking pattern solves this lesson cleanly?
Practice this question from N-Queens - Constraint Backtracking Pattern Practice Quiz, with options and an explanation.
Question
Which optimized recursion/backtracking pattern solves this lesson cleanly?
Option A — Correct answer
Constraint backtracking with column and diagonal sets.
Option B
Greedy choice without backtracking
Option C
Hash lookup without recursion state
Option D
Two pointers only
Explanation
Constraint backtracking with column and diagonal sets.