Problems > Minimum Subarray Sum > Editorial

Minimum Subarray Sum — Solution & Editorial

Back to the Problem

Kadane with min instead of max (equivalently negate everything and run the maximum version).

Complexity: O(N)