Recursion Practice Questions
Six classic interview problems that lock in the recursion patterns you’ve learned. They cover the full range: linear recursion, fast-doubling, divide & conquer, and backtracking.
For each one, before reading the solution, answer the three questions: What’s the base case? What’s the recursive call? How do I combine? If you can answer all three out loud, you can write the code.
Easy
| Problem | Pattern | Status |
|---|---|---|
| Climbing Stairs | Fibonacci-shaped DP | Available |
| Pow(x, n) | Fast exponentiation | Available |
| Tower of Hanoi | Classic recursion | Available |
Medium
| Problem | Pattern | Status |
|---|---|---|
| Generate Parentheses | Backtracking | Available |
| Subsets (Power Set) | Backtracking | Available |
| Permutations | Backtracking | Available |
More Practice (Coming Soon)
| Problem | Pattern | Status |
|---|---|---|
| Letter Combinations of a Phone Number | Backtracking | Coming Soon |
| Combination Sum | Backtracking | Coming Soon |
| Word Search | DFS + backtracking | Coming Soon |
| N-Queens | Backtracking | Coming Soon |
| Sudoku Solver | Backtracking | Coming Soon |
| Restore IP Addresses | Backtracking | Coming Soon |