midArrays
What is Kadane’s Algorithm?
Updated Apr 28, 2026
Short answer
Kadane finds maximum subarray sum in O(n).
Deep explanation
It tracks current sum and resets when negative, ensuring optimal subarray selection.
Real-world example
Stock profit analysis.
Common mistakes
- Ignoring negative-only arrays.
Follow-up questions
- Why reset?
- Time complexity?