These are the recursion problems every placement candidate should be able to solve, from a recursive sum to the last-standing circle. Write the base case first, then the recursive case, and check how deep the calls can go. Trace each one with a small input, then run every test.
