EasyRememberRecursion & BacktrackingMultiple Choice
What is the recursion base case for Combination Sum (LC 39)?
Remember — Tests recall of fundamental facts and definitions.
Answer Options
AWhen path is empty
BWhen remaining == 0 (valid solution found)
CWhen index exceeds candidates length
DWhen path length equals target
Want to see the correct answer?
Get the answer with a detailed explanation, plus practice 32+ more Recursion & Backtracking questions with adaptive quizzes and timed interviews.
See the Answer on Guru Sishya →This question is from the Recursion & Backtracking topic (Algorithms).
More Recursion & Backtracking Questions
What does the 'un-choose' step in backtracking accomplish?
EasyFor Letter Combinations of Phone Number (LC 17) with input '23', how many combinations are there?
EasyWhat is the key difference between permutations and combinations in backtracking?
Medium-EasyIn backtracking, why must you push `[...path]` instead of `path` to the result?
Medium-EasyTime complexity of generating all permutations of n distinct elements?
Medium-Easy