6 subtopics · 23 problems
Dynamic Programming — Fundamentals
Core DP patterns: linear, 2D grid, knapsack, LIS, and LCS.
011D DP (Linear)
Classic problems with dp[i] depending on previous states.
2 easy2 medium1 hard
| Problem | Difficulty | Link |
|---|---|---|
| 1873D1D Eraser | easy | Solve |
| 455ABoredom | easy | Solve |
| 1829DGold Rush | medium | Solve |
| 1324DPair of Topics | medium | Solve |
| 1881EBlock Sequence | hard | Solve |
022D Grid DP
Count paths or maximize values on a grid.
2 medium1 hard
| Problem | Difficulty | Link |
|---|---|---|
| 1360GA/B | medium | Solve |
| 598BQueries on a String | medium | Solve |
| 1006FXor Paths | hard | Solve |
03Knapsack Variants
0-1 Knapsack, unbounded knapsack, and subset sum.
2 medium2 hard
| Problem | Difficulty | Link |
|---|---|---|
| 1862DIce Cream Balls | medium | Solve |
| 431Ck-Tree | medium | Solve |
| 1862EKolya and Movie Theatre | hard | Solve |
| 1900DSmall GCD | hard | Solve |
04Longest Increasing Subsequence (LIS)
O(n log n) LIS using patience sorting.
3 medium1 hard
| Problem | Difficulty | Link |
|---|---|---|
| 1579E2Array Optimization by Deque (hard) | medium | Solve |
| 1851DPrefix Permutation Sums | medium | Solve |
| 1904CArray Game | medium | Solve |
| 1904DSet To Max | hard | Solve |
05Longest Common Subsequence (LCS)
Classic O(n·m) DP for comparing two sequences.
2 medium1 hard
| Problem | Difficulty | Link |
|---|---|---|
| 1203D2Remove the Substring (hard) | medium | Solve |
| 1279BVerse For Santa | medium | Solve |
| 1900DSmall GCD | hard | Solve |
06Coin Change & Unbounded Knapsack
Min coins, number of ways to make change, unbounded selections.
1 easy2 medium1 hard
| Problem | Difficulty | Link |
|---|---|---|
| 1873BGood Kid | easy | Solve |
| 431Ck-Tree | medium | Solve |
| 1513CAdd One | medium | Solve |
| 1398CGood Subarrays | hard | Solve |
Was this helpful?