Maximum Subarray
Find the contiguous subarray with the largest sum.
Progress cannot be saved in this browser, so completed lessons will reset when you leave.
Lesson notes
Try it before you watch
Restate the problem in your own words, list the edge cases, and sketch a solution with its running time. Then play the video and compare.
Reveal the key idea
Kadane's algorithm: at every index either extend the best subarray ending at the previous index or start fresh, and track the best sum seen.
Pattern: Dynamic programming. Define a state, write the recurrence between states, and compute each state only once.
Complexity
| Measure | Bound |
|---|---|
| Time | O(n) |
| Extra space | O(1) |
Walkthroughs often start from a simpler approach first; aim to reach these bounds. New to Big-O? Read understanding algorithmic complexity.