Kadane's Algorithm (Max Subarray) Problems
10 Kadane's Algorithm (Max Subarray) problems on LeetCode, a Arrays & Hashing 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 | Maximum Subarray | Easy | 1200 | 93 | Linear Recurrence DP |
| 2 | Best Time to Buy and Sell Stock | Easy | 1053 | 92 | Linear Recurrence DP |
| 3 | Maximum Sum Circular Subarray | Medium | 1777 | 79 | Prefix Sums |
| 4 | Find the Substring With Maximum Cost | Medium | 1422 | 68 | Frequency Counting / Hash Map Lookup |
| 5 | Maximum Score Of Spliced Array | Medium | 1791 | 62 | Linear Recurrence DP · Prefix Sums |
MORE ARRAYS & HASHING PATTERNS
// your mastery
What's your Kadane's Algorithm (Max Subarray) tier?
leaps.gg syncs your LeetCode history, scores your Kadane's Algorithm (Max Subarray) mastery, and recommends exactly which problems to do next with spaced repetition. Free to start.
GET MY MASTERY MAP →