Maximum Subarray With Explanation

MediumPython

Problem

Solve a problem involving finding the maximum subarray sum and explain your approach.

Implement max_subarray_sum(nums), where nums is a non-empty list of integers. Return the largest possible sum of any contiguous, non-empty subarray.

The result must be correct when all values are negative, and the algorithm should run in linear time with constant extra space.

Constraints

1 <= nums.length <= 100000
-10000 <= nums[i] <= 10000
The subarray must be contiguous and non-empty

Function Signature

def max_subarray_sum(nums):

CodePython 3

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

Run your code to see test output here.