Problems

Maximum Subarray

Maximum Subarray

Medium
ArrayDPDivide & ConquerAcceptance 50.3%

Given an integer array `nums`, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example 1
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has the largest sum 6.

Constraints

  • • 1 <= nums.length <= 10^5
  • • -10^4 <= nums[i] <= 10^4
solution.js
JavaScript (Node 20)
Loading...
Run or submit your code to see results here.