← All courses
♟️Advanced
Recursion, Backtracking & Dynamic Programming
The hardest interview territory, made tractable: recursion patterns, divide and conquer, backtracking, and dynamic programming — from spotting overlapping subproblems to memoization, tabulation, and the classic DP problems.
Volume 4 · Part VII · 10 chapters · 10 lessons
Share
Free
What you'll learn
- Recursion Patterns
- Divide & Conquer
- Backtracking
- Subsets, Permutations & Combinations
- Introduction to Dynamic Programming
- Memoization (Top-Down)
- Tabulation (Bottom-Up)
- Classic 1-D DP
- Classic 2-D DP
- Greedy vs DP
Curriculum
3 modules · 10 lessonsModule 1Recursion & Backtracking4 lessons
Recursion PatternsPreviewDivide & Conquer
Backtracking
Subsets, Permutations & Combinations
Module 2Dynamic Programming3 lessons
Introduction to Dynamic Programming
Memoization (Top-Down)
Tabulation (Bottom-Up)
Module 3DP Patterns3 lessons
Classic 1-D DP
Classic 2-D DP
Greedy vs DP
Reviews
No reviews yet.
