Kadane's Algorithm Visualization
Problem Statement:
Kadane's Algorithm:
Find the maximum subarray sum in O(n).
Example:
nums = [3, -2, 5, -1, 6, -3, 2]
Previous
Next
Auto Move
Reset
Step 0: Initialize curr=0, best=-∞