CodeOath
← All problems

Maximum Subarray

Medium
arraysdynamic-programming

Find the contiguous subarray with the largest sum, and return that sum.

Example:

Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6