Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
Digit DP
Problemset
Discussion
AI Helper
Recursion Fundamentals
0/42
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
1
Intro
2
Core Concept
3
Vocabulary - Tight Bound
4
Quiz: Tight Bound
5
Vocabulary - Leading Zeros
6
Quiz: Leading Zeros
7
The General Pattern
8
Range Queries
9
LeetCode 902 Numbers At Most N Given Digit Set - Problem Statement
10
Digit Set - The Setup
11
Digit Set - State Definition
12
Digit Set - Transition
13
Digit Set - Implementation
14
Digit Set - Walkthrough
15
Lessons from Digit Set
16
Challenge: Digit Set Edge Cases
17
LeetCode 2376 Count Special Integers - Problem Statement
18
Special Integers - The Setup
19
Special Integers - State Definition
20
Special Integers - Transition
21
Special Integers - Implementation
22
Special Integers - Walkthrough
23
Lessons from Special Integers
24
Quiz: Bitmask in Digit DP
25
LeetCode 600 Non-negative Integers without Consecutive Ones - Problem Statement
26
Consecutive Ones - The Setup
27
Consecutive Ones - State Definition
28
Consecutive Ones - Transition
29
Consecutive Ones - Implementation
30
Consecutive Ones - Walkthrough
31
Lessons from Consecutive Ones
32
Challenge: K Consecutive Ones
33
Pattern - Digit DP
34
Digit Sum - Problem Statement
35
Digit Sum - Implementation
36
Quiz: Digit DP Complexity
37
Count Stepping Numbers - Problem Statement
38
Stepping Numbers - Implementation
39
Challenge: Digit DP on Multiple Numbers
40
Pattern - When to Use Digit DP
41
What's Next
42
Section Recap
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
13.1
Intro
4 minutes
100%
Tasks
Read Unit