Linear Recurrence DP Problems
257 Linear Recurrence DP problems on LeetCode, a Core DP interview pattern, ranked by importance (how often it comes up in real interviews). Difficulty (ELO) and importance shown per problem.
| # | PROBLEM | DIFF | ELO | IMP | PATTERNS |
|---|---|---|---|---|---|
| 1 | Climbing Stairs | Easy | 1098 | 92 | |
| 2 | House Robber | Easy | 1274 | 92 | |
| 3 | Min Cost Climbing Stairs | Easy | 1358 | 88 | |
| 4 | Maximum Product Subarray | Medium | 1438 | 86 | Kadane's Algorithm (Max Subarray) |
| 5 | Best Time to Buy and Sell Stock with Cooldown | Medium | 1538 | 84 |
MORE CORE DP PATTERNS
// your mastery





What's your Linear Recurrence DP tier?
leaps.gg syncs your LeetCode history, scores your Linear Recurrence DP mastery, and recommends exactly which problems to do next with spaced repetition. Free to start.
GET MY MASTERY MAP →