Maximum Subarray

Visualize Kadane's Algorithm: at each position, decide whether to start fresh or extend the previous subarray.

Array A

Enter comma-separated integers.

Core decision

Start at A[i], or extend the previous best ending here?

current = max(A[i], current + A[i])

Best subarray Current candidate Unselected

Index i

—

Best sum ending at i

—

Global maximum sum

—

Step history

i	A[i]	Extend	Start fresh	Current	Best

Maximum contiguous subarray

Maximum sum =

Time complexity: O(n) · Extra space: O(1)