Skip to main content

Recursion & Backtracking Quiz

Editorial

16 questions across the four Recursion & Backtracking lessons and the section's problems: trusting the smaller call, subsets and combinations, permutations and partitions, and searching a board under rules. Pick an answer to see whether it's right and why. Nothing is saved, so you can take it again.

If one trips you up, its lesson is Thinking Recursively, Backtracking: Subsets and Combinations, Backtracking: Permutations and Partitions or Backtracking on Grids and Constraints.

Quiz

1 / 16

Multiple choice

You reverse the stack 1, 2, 3, 4, 5, 6 (bottom to top) with the lesson's two recursions. How many calls to insert at the bottom does it make in all?