Maximum Subarray Sum Problem Statement

Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.

Explanation:

A subarray is a contiguous segment of an array, meaning it can be formed by removing 0 or more integers from the start, and 0 or more integers from the end of the array.

Input:

N arr[0] arr[1] ... arr[N-1]

Output:

The sum of the maximum subarray.

Example:

Input:

N = 5 arr = [-2, 1, -3, 4, -1]

Output:

4

Explanation:

The maximum subarray sum is obtained by the subarray [4] which has the sum 4.

Constraints:

1

Question

Maximum Subarray Sum Problem Statement

Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.

Explanation:

A subarray is a contiguous segment of an array, meaning it can be formed by removing 0 or more integers from the start, and 0 or more integers from the end of the array.

Input:

N
arr[0] arr[1] ... arr[N-1]

Output:

The sum of the maximum subarray.

Example:

Input:

N = 5
arr = [-2, 1, -3, 4, -1]

Output:

Explanation:

The maximum subarray sum is obtained by the subarray [4] which has the sum 4.

Constraints:

1 <= N <= 10^6
-10^6 <= arr[i] <= 10^6

Note:

The sum of an empty subarray is considered 0.

Accepted Answer

Find the sum of the subarray with the maximum sum among all subarrays in an array of integers.

Iterate through the array and keep track of the current sum and maximum sum.
If the current sum becomes negative, reset it to 0.
Return the maximum sum found.