"Section 5: Recursion — Easy/Medium"
Overview
Building intuition for recursive thinking — the foundation for trees, graphs, and dynamic programming.
Lessons
| # | Lesson Name | Duration | Notes |
|---|---|---|---|
| 1 | Recursion 101 | 1h 10m 13s | |
| 2 | Sum of First N Numbers | 37m 16s | |
| 3 | Sum of All Numbers in Array | — | |
| 4 | Factorial of N | 8m 57s | |
| 5 | Power of Two | 9m 43s | |
| 6 | Recursion Masterclass | 1h 3m 35s |
Lesson Checklist
- [ ] Recursion 101 (1h 10m 13s)
- [ ] Sum of First N Numbers (37m 16s)
- [ ] Sum of All Numbers in Array
- [ ] Factorial of N (8m 57s)
- [ ] Power of Two (9m 43s)
- [ ] Recursion Masterclass (1h 3m 35s)
My Notes
Add your personal notes, key takeaways, and insights here as you progress through the section.
Recursion Framework
- Base case — when to stop
- Recursive case — break problem into smaller subproblem
- Trust the recursion — assume it works for n-1
Problem Notes
Recursion 101
Factorial of N
- f(n) = n \* f(n-1), base case f(0) = 1
Power of Two
Recursion Masterclass