Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
Recursion Fundamentals
Problemset
Discussion
AI Helper
Recursion Fundamentals
0/42
1
Intro
2
Core Concept
3
Vocabulary - Base Case
4
Vocabulary - Recursive Case
5
Factorial - Problem Statement
6
Quiz: Base Case
7
Factorial - Base Case
8
Factorial - Recursive Formula
9
Factorial - Implementation
10
Factorial - Walkthrough
11
Visualization - Call Stack
12
Quiz: Call Stack
13
Lessons from Factorial
14
Sum of Digits - Problem Statement
15
Quiz: Recursive Structure
16
Sum of Digits - Base Case
17
Sum of Digits - Recursive Formula
18
Sum of Digits - Implementation
19
Sum of Digits - Walkthrough
20
GCD - Problem Statement
21
Quiz: GCD
22
GCD - The Key Observation
23
GCD - Base Case
24
GCD - Recursive Formula
25
GCD - Implementation
26
GCD - Walkthrough
27
Challenge: Trace GCD
28
Power Function - Problem Statement
29
Quiz: Power Function
30
Power Function - Naive Recursion
31
Power Function - The Optimization
32
Power Function - Base Cases
33
Power Function - Implementation
34
Power Function - Walkthrough
35
Quiz: Optimized Power
36
Lessons from Recursion
37
Pattern - Recursive Decomposition
38
Common Recursion Mistakes
39
Recursion vs Iteration
40
Quiz: Recursion vs Iteration
41
What's Next
42
Section Recap
Dynamic Programming Fundamentals
0/44
1D DP
0/41
Multi-Dimensional DP
0/40
Knapsack
0/43
Knapsack Variations
0/46
Prefix Sums
0/44
Longest Increasing Subsequence
0/47
LCS and Edit Distance
0/41
Interval DP
0/45
DP on Trees
0/43
Bitmask DP
0/42
Digit DP
0/42
Game Theory DP
0/46
Probability DP
0/44
D&C and Knuth Optimization
0/47
Convex Hull Trick
0/43
Monotonic Queue Optimization
0/45
Aliens Trick (WQS Binary Search)
0/41
Slope Trick
0/47
Broken Profile DP (Plug DP)
0/42
1.1
Intro
4 minutes
100%
Tasks
Read Unit