Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
Convex Hull Trick
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
Game Theory DP
0/46
Probability DP
0/44
D&C and Knuth Optimization
0/47
Convex Hull Trick
0/43
1
Intro
2
A Different Pattern
3
Vocabulary - Linear Function
4
Rewriting the DP
5
Quiz: Linear Form Recognition
6
The Key Observation
7
Vocabulary - Lower Envelope
8
Quiz: Lower Envelope
9
Why Most Lines Don't Matter
10
What Is the Convex Hull Trick?
11
When Queries Are Sorted
12
The Deque Approach
13
Deque Operations - Walkthrough
14
Adding a New Line
15
Quiz: Deque Invariant
16
Querying the Minimum
17
CHT Query - Walkthrough
18
Why O(n) Total
19
Visualizing CHT
20
Codeforces 319C Kalila and Dimna - Problem Statement
21
Codeforces 319C Kalila and Dimna - The DP
22
Codeforces 319C Kalila and Dimna - CHT Form
23
Codeforces 319C Kalila and Dimna - Why It Works
24
Codeforces 319C Kalila and Dimna - Implementation
25
Codeforces 319C Kalila and Dimna - Walkthrough
26
Lessons from CHT
27
Challenge: Non-Sorted Slopes
28
When Queries Aren't Sorted
29
Binary Search on the Hull
30
Vocabulary - Li Chao Tree
31
Li Chao Tree - Walkthrough
32
Quiz: Li Chao vs Deque
33
Common Mistakes
34
Commando - Problem Statement
35
Commando - Implementation
36
Covered Walkway - Problem Statement
37
Quiz: Covered Walkway Algebra
38
Challenge: 2D CHT
39
Pattern - Convex Hull Trick
40
Pattern - CHT Recognition
41
Implementation Tips
42
What's Next
43
Section Recap
Monotonic Queue Optimization
0/45
Aliens Trick (WQS Binary Search)
0/41
Slope Trick
0/47
Broken Profile DP (Plug DP)
0/42
17.1
Intro
4 minutes
100%
Tasks
Read Unit