AlgoSolveoRoadmap › Stage 2: Arrays & Strings › Pattern 9 of 53
DSA pattern guide
Array — Kadane's Algorithm
Maximum (or minimum) sum or product of a contiguous subarray.
Use it when
Maximum (or minimum) sum or product of a contiguous subarray.
Key idea
At each element decide: extend the current run or start fresh here. Track the best run seen.
Practice problems, in order
- Maximum SubarrayMedium
- Maximum Product SubarrayMedium
- Maximum Sum Circular SubarrayMedium
- Maximum Absolute Sum of Any SubarrayMedium
How to practise this pattern
- Read the problem and look for the signal above before writing any code.
- Say the brute force out loud, with its time complexity, then ask what work it repeats.
- Apply the key idea and write the optimised version yourself.
- If you're stuck for more than 10 minutes, take one small hint, not the full solution.
- Move to the next problem only when you can explain why this pattern fits.
Stuck on one of these?
The AlgoSolveo extension (free, launching soon) sits beside the LeetCode problem and gives the smallest hint that gets you moving, never the full answer. Solved problems tick off on your roadmap.
Join the extension waitlistTrack it on the roadmap