Which optimized recursion/backtracking pattern solves this lesson cleanly?
Practice this question from Combination Sum - Reuse Choice Backtracking Pattern Practice Quiz, with options and an explanation.
Question
Which optimized recursion/backtracking pattern solves this lesson cleanly?
Option A — Correct answer
Backtracking with start index and reusable choices.
Option B
Greedy choice without backtracking
Option C
Hash lookup without recursion state
Option D
Two pointers only
Explanation
Backtracking with start index and reusable choices.