Longest Increasing Subsequence Problems
23 Longest Increasing Subsequence 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 | Longest Increasing Subsequence | Medium | 1407 | 93 | Boundary Finding (Bisect Left/Right) |
| 2 | Find the Longest Valid Obstacle Course at Each Position | Hard | 1933 | 78 | Boundary Finding (Bisect Left/Right) |
| 3 | Russian Doll Envelopes | Hard | 2062 | 78 | Sorting + Comparison · Boundary Finding (Bisect Left/Right) |
| 4 | Number of Longest Increasing Subsequence | Medium | 1744 | 74 | Linear Recurrence DP |
| 5 | Longest String Chain | Medium | 1599 | 73 | Frequency Counting / Hash Map Lookup · Sorting + Comparison |
MORE CORE DP PATTERNS
// your mastery
What's your Longest Increasing Subsequence tier?
leaps.gg syncs your LeetCode history, scores your Longest Increasing Subsequence mastery, and recommends exactly which problems to do next with spaced repetition. Free to start.
GET MY MASTERY MAP →