Skip to content
dp from start
Table 12
Fibonacci, Climbing Stairs
Either (memoization is simpler)
Both are O(n) time and space.
Knapsack, LCS, Edit Distance
Tabulation
Requires filling an entire table; tabulation is cleaner and faster.
Tree/Graph DP
Memoization
Recursive structure aligns with tree/graph traversal.
Digit DP
Memoization
Recursive digit-by-digit processing is intuitive.
Grid Path Problems
Tabulation
Iterative row/column filling is natural.
Subset Sum, Partition Problems
Tabulation
All subproblems are needed; tabulation avoids recursion overhead.
There are no rows in this table
Here’s a topic-wise list of non-premium LeetCode DP problems, categorized by pattern. These problems are curated to help you build intuition step by step, from beginner to advanced.
1. 1D Dynamic Programming
Pattern: Solve problems using a 1D array where dp[i] depends on previous values.
Table 13
Problem
Linksr
Difficulty
Checkbox
Best Time to Buy and Sell Stock with Cooldown
Medium
There are no rows in this table
2. 2D Dynamic Programming (Grid/Table)
Pattern: Use a 2D table where dp[i][j] depends on previous rows/columns.
Table 14
problem
link
difficulty
Checkbox
There are no rows in this table
3. Knapsack Problems
Pattern: Select items to maximize value without exceeding a weight/capacity constraint.
Table 15
Problem
LeetCode Link
Difficulty
Checkbox
0/1 Knapsack (Classic)
[Not directly on LeetCode, but see "Partition Equal Subset Sum" below]
Medium
There are no rows in this table
4. Interval DP
Pattern: Break problems into intervals and combine results.
Table 16
Problem
LeetCode Link
Difficulty
Checkbox
Matrix Chain Multiplication
[Not directly on LeetCode, but see "Minimum Score Triangulation of Convex Polygon" below]
Hard
Minimum Score Triangulation of Convex Polygon
Medium
There are no rows in this table
5. State Compression DP
Pattern: Use bitmasking or states to represent subsets or configurations.
Table 17
Problem
LeetCode Link
Difficulty
Checkbox
Subset Sum
[Not directly on LeetCode, but see "Partition Equal Subset Sum" above]
Medium
There are no rows in this table
6. Digit DP
Pattern: Process numbers digit by digit with constraints.
Table 18
Problem
LeetCode Link
Difficulty
Checkbox
Digit DP Template (Not a specific problem, but useful for problems like "Numbers At Most N Given Digit Set")
Hard
There are no rows in this table
7. Game Theory DP
Pattern: Model games where players take turns (e.g., minimax).
Table 19
Problem
LeetCode Link
Difficulty
Checkbox
There are no rows in this table
8. String DP
Pattern: DP problems involving string manipulation or matching.
Table 20
Problem
LeetCode Link
Difficulty
Checkbox
Longest Common Substring
[Not directly on LeetCode, but see "Minimum Window Substring" or "LCS" above]
Medium
There are no rows in this table
9. Miscellaneous DP Problems
Pattern: Unique DP problems that don’t fit neatly into the above categories.
Table 21
Longest Valid Parentheses
32. Longest Valid Parentheses
Hard
There are no rows in this table
10. DP on Trees
Pattern: DP problems involving tree structures.
Table 22
Problem
LeetCode Link
Difficulty
There are no rows in this table
How to Use This List
Tips for Practicing
Want to print your doc?
This is not the way.
This is not the way.
Try clicking the ⋯ next to your doc name or using a keyboard shortcut (
CtrlP
) instead.