Recursion for problem solving
Comes up in: DSA
This concept is being written. It gets the full five steps — explanation, predict, interview angle, practice with tests, and review cards. Here is exactly what it will cover, so you can study it elsewhere in the meantime.
What it covers
- base case + smaller sub-problem
- recursion tree
- call-stack trace
- recursion vs iteration
- memoising a recursion (bridge to DP)
Words you will know
What you will practise
- power, sum of digits, reverse string recursively
Interview questions this answers
- Walk me through how you approach an unseen coding problem.
- When would you choose recursion over iteration?