Kadane's Algorithm
Find maximum subarray sum in O(n). LC 53, 152, 918.
Array element
Current scan
Current subarray
Max subarray
Controls
Time: O(n) | Space: O(1)
Steps
0 stepsPress Run to trace the algorithm one step at a time.