Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
1D DP
Problemset
Discussion
AI Helper
Recursion Fundamentals
0/42
Dynamic Programming Fundamentals
0/44
1D DP
0/41
1
Intro
2
From Memoization to Problems
3
DP Pattern and Importance
4
LeetCode 198 House Robber - Problem Statement
5
LeetCode 198 House Robber - Why Greedy Fails
6
LeetCode 198 House Robber - Defining the DP
7
LeetCode 198 House Robber - Transition
8
LeetCode 198 House Robber - Base Cases
9
LeetCode 198 House Robber - Final Answer
10
LeetCode 198 House Robber - Implementation
11
Quiz: House Robber State
12
Lessons from House Robber
13
Codeforces 455A Boredom - Problem Statement
14
Codeforces 455A Boredom - Defining the DP
15
Codeforces 455A Boredom - Transition
16
Codeforces 455A Boredom - Base Cases
17
Codeforces 455A Boredom - Final Answer
18
Codeforces 455A Boredom - Implementation
19
Quiz: Boredom Reduction
20
Codeforces 977F Consecutive Subsequence - Problem Statement
21
Codeforces 977F Consecutive Subsequence - State Definition - 1
22
Codeforces 977F Consecutive Subsequence - State Definition - 2
23
Codeforces 977F Consecutive Subsequence - Transition
24
Codeforces 977F Consecutive Subsequence - Base Cases
25
Codeforces 977F Consecutive Subsequence - Final Answer and Reconstruction
26
Codeforces 977F Consecutive Subsequence - Implementation
27
Quiz: Consecutive Subsequence
28
Vocabulary - State Compression
29
Lessons from Boredom and Consecutive Subsequence
30
Pattern - Adjacent Blocking
31
Challenge: Trace Boredom
32
Quiz: 1D DP Patterns
33
Codeforces 1741E Sending a Sequence - Problem Statement
34
Codeforces 1741E Sending a Sequence - From Intuition to Prefix States
35
Codeforces 1741E Sending a Sequence - Defining the State and Base Case
36
Codeforces 1741E Sending a Sequence - Determining the Final Answer
37
Codeforces 1741E Sending a Sequence - Transition Case 1
38
Codeforces 1741E Sending a Sequence - Transition Case 2
39
Practice - Maximum Points
40
What's Next
41
Section Recap
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
3.1
Intro
4 minutes
100%
Tasks
Read Unit