Maximum Sum Contiguous Subarray | Dataford Interview Questions

Find the contiguous subarray within an integer array that yields the maximum possible sum and return that sum.

Implement max_subarray(nums), where nums is a non-empty list of integers. Return an integer representing the largest sum among all contiguous, non-empty subarrays.

Function Contract

Input: nums, a non-empty list of integers
Output: the maximum contiguous subarray sum

Constraints

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

Function Signature

def max_subarray(nums):

Your question is Maximum Sum 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