MediumTopic: Dynamic Programming & ArraysExpected: O(N) Time • O(1) Space
Maximum Subarray Sum (Kadane)
Given an integer array `nums`, find the subarray with the largest sum, and return its sum. A subarray is a contiguous non-empty sequence of elements within an array.
Examples
Input: nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6
The subarray [4, -1, 2, 1] has the largest sum 6.
Input: nums = [1]
Output: 1
Input: nums = [5, 4, -1, 7, 8]
Output: 23
Constraints
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4
solution.js
JavaScript (ES6+)Test Execution Results
Input:
[[-2,1,-3,4,-1,2,1,-5,4]]Expected:
6Your Output:
--