Largest Contiguous Subarray | Dataford Interview Questions

How would you find the largest sum of a contiguous subarray?

Implement max_subarray_sum(nums) for a non-empty list of integers. Return the largest possible sum among all non-empty contiguous subarrays. The solution should run in linear time and use constant extra space.

Input and Output

nums is a non-empty list of integers. Return an integer containing the maximum contiguous-subarray sum.

Constraints

1 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
The input list is non-empty
The result fits within a signed 64-bit integer

Function Signature

def max_subarray_sum(nums):

Your question is Largest Contiguous Subarray. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem