>_
CodeCraftStudio IDE
Problem List|
4. Maximum Subarray (Kadane)
Medium
Dynamic Programming • 110 pts

Maximum Subarray (Kadane)

Medium
Acceptance: 51.3%Topic: Dynamic Programming
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

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.
Example 2:
Input: nums = [1]
Output: 1
Example 3:
Input: nums = [5,4,-1,7,8]
Output: 23

Constraints

  • 1 <= nums.length <= 10^5
  • -10^4 <= nums[i] <= 10^4
Solution:
solution.js
javascript
13
1
Ln 1, Col 11 lines
UTF-8
Mixed positive and negative array
Input:
[[-2,1,-3,4,-1,2,1,-5,4]]
Expected Output:
6