TOPIC
DYNAMIC PROGRAMMING
Every dynamic programming problem in the series, in the order the worlds teach them.
19 STAGES
EASY1:25Climbing Stairs
LC 70▶ START
MEDIUM1:25House Robber
LC 198▶ START
MEDIUM1:35House Robber II
LC 213▶ START
MEDIUM1:41Maximum Product Subarray
LC 152▶ START
MEDIUM1:42Best Time to Buy and Sell Stock with Cooldown
LC 309▶ START
MEDIUM1:46Best Time to Buy and Sell Stock with Transaction Fee
LC 714▶ START
MEDIUM1:40Decode Ways
LC 91▶ START
MEDIUM1:37Unique Paths
LC 62▶ START
MEDIUM1:37Coin Change
LC 322▶ START
MEDIUM1:40Perfect Squares
LC 279▶ START
MEDIUM1:41Partition Equal Subset Sum
LC 416▶ START
MEDIUM1:37Word Break
LC 139▶ START
MEDIUM1:40Longest Increasing Subsequence
LC 300▶ START
MEDIUM1:43Longest Common Subsequence
LC 1143▶ START
HARD1:34Distinct Subsequences
LC 115▶ START
HARD1:41Maximum Profit in Job Scheduling
LC 1235▶ START
HARD1:38Edit Distance
LC 72▶ START
HARD1:40Regular Expression Matching
LC 10▶ START
HARD1:35Longest Valid Parentheses
LC 32▶ START
More topics
- Backtracking 17
- Greedy 17
- Tree recursion 13
- Bit manipulation 8
- Design 8
- Two pointers 8
- Hash map 7
- Heap 7
- Binary search 6
- Breadth-first search 5
- Linked list 5
- Fast and slow pointers 4
- Grid search 4
- Shortest path 4
- Depth-first search 3
- Math 3
- Carry 2
- Hash set 2
- Matrix 2
- Monotonic stack 2
- Prefix sums 2
- Sliding window 2
- Stack 2
- Topological sort 2
- Trie 2