Maximum Subarray Using Kadane

EasyPython

Problem

Given an integer array nums, return the largest possible sum of any non-empty contiguous subarray. The solution should use Kadane's Algorithm, which scans the array once and decides at each position whether to extend the current subarray or start a new one.

Constraints

1 <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4
The subarray must be contiguous and non-empty

Function Signature

def max_subarray(nums):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.