Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
Dynamic Programming Fundamentals
Problemset
Discussion
AI Helper
Recursion Fundamentals
0/42
Dynamic Programming Fundamentals
0/44
1
Intro
2
LeetCode 509 Fibonacci - Problem Statement
3
LeetCode 509 Fibonacci - Base Cases
4
LeetCode 509 Fibonacci - Recursive Formula
5
LeetCode 509 Fibonacci - Naive Implementation
6
Visualization - Fibonacci Tree
7
Vocabulary - Overlapping Subproblems
8
Time Complexity - Exponential Growth
9
The Main Idea
10
Recursion to DP
11
What Is Memoization?
12
Vocabulary - Top-Down DP
13
LeetCode 509 Fibonacci - Memoization Setup
14
LeetCode 509 Fibonacci - Memoized Code
15
Memoization - Time Complexity
16
Memoization - Space Complexity
17
LeetCode 70 Climbing Stairs - Problem Statement
18
LeetCode 70 Climbing Stairs - Recursive Intuition
19
LeetCode 70 Climbing Stairs - Memoized Solution
20
LeetCode 70 Climbing Stairs - Implementation
21
Quiz: Memoization Complexity
22
Lessons from Memoization
23
What Is Tabulation?
24
Vocabulary - Bottom-Up DP
25
LeetCode 509 Fibonacci - Tabulation Implementation
26
Space Optimization
27
LeetCode 509 Fibonacci - O(1) Space
28
Top-Down vs Bottom-Up
29
LeetCode 746 Min Cost Climbing Stairs - Problem Statement
30
LeetCode 746 Min Cost Climbing Stairs - State Definition
31
LeetCode 746 Min Cost Climbing Stairs - Transition
32
LeetCode 746 Min Cost Climbing Stairs - Implementation
33
LeetCode 152 Maximum Product Subarray - Problem Statement
34
LeetCode 152 Maximum Product Subarray - Why It's Tricky
35
LeetCode 152 Maximum Product Subarray - Tracking Two States
36
LeetCode 152 Maximum Product Subarray - Implementation
37
Quiz: Simple DP Patterns
38
LeetCode 91 Decode Ways - Problem Statement
39
LeetCode 91 Decode Ways - The Choices
40
LeetCode 91 Decode Ways - Edge Cases
41
LeetCode 91 Decode Ways - State Definition
42
LeetCode 91 Decode Ways - Transition
43
LeetCode 91 Decode Ways - Implementation
44
Section Recap
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
2.1
Intro
4 minutes
100%
Tasks
Read Unit