#4 medium dynamic-programming

Maximum Subarray

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

A subarray is a contiguous part of an array.

Example 1

Input:  nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: [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

Hint 1: Try Kadane's algorithm — track the current subarray sum and the global maximum.

Hint 2: At each step decide: extend the current subarray or start a new one from the current element.

Run your code to see AI analysis