BackmediumArrays arrays kadanes-algorithm

Maximum Contiguous Sum Solution

Problem Statement

Given an array of integers `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 contiguous subarray [4, -1, 2, 1] has the largest sum = 6.

Constraints

1 <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4

More Arrays Problems

Move Zeros to Endeasy Sorted Squareseasy Find Balance Indexeasy Partition Even Oddeasy

View all problems →

Live Compiler

Loading...

Test Cases & Output

Custom Input

Output

🔒 Sign up to run your code

🚀 Practice this problem

Run code, get AI hints & track streak