FrontendInterviews.dev

107. Maximum Subarray - Best Period Analysis

Medium•

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

Examples

maxSubArray([-2,1,-3,4,-1,2,1,-5,4]); // 6
// Explanation: [4,-1,2,1] has the largest sum = 6

maxSubArray([1]); // 1
maxSubArray([5,4,-1,7,8]); // 23

Constraints

1 <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4
Subarray must be contiguous
At least one element in subarray

Accepted25/38|Acceptance Rate65.8%