MediumDynamic Programming•Acceptance: 50.4%
Maximum Subarray: Kadane's Algorithm
Real-World Engineering Context
Used in computer vision (finding highest-contrast regions in an image) and genomic sequence alignment to locate protein coding regions.
Given an integer array `nums`, find the subarray with the largest sum, and return its sum.
Sample Test Cases
Input: [[-2,1,-3,4,-1,2,1,-5,4]]
Expected: 6
Input: [[1]]
Expected: 1
Input: [[5,4,-1,7,8]]
Expected: 23
Constraints
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4
Language:
Loading Monaco Code Editor (VS Code Engine)...
Lazy loaded client-side bundleReady to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.