NexCode
ProblemsSubmissions
HA
Problems
Connecting

53. Maximum Subarray

Medium
ArrayDivide and ConquerDynamic Programming

Given an integer array nums, find the contiguous subarray with the largest sum and return that sum.

Input

nums = [-2,1,-3,4,-1,2,1,-5,4]

Expected

6