Max Sum Contiguous Subarray

Asked in:
Facebook
Paypal
Yahoo
Microsoft
LinkedIn
Amazon
Goldman Sachs
Deloitte
DE Shaw

Problem Description

Find the contiguous subarray within an array, A of length N which has the largest sum.

Problem Constraints

1 <= N <= 10⁶
-1000 <= A[i] <= 1000

Input Format

The first and the only argument contains an integer array, A.

Output Format

Return an integer representing the maximum possible sum of the contiguous subarray.

Example Input

Input 1:

A = [1, 2, 3, 4, -10]

Input 2:

A = [-2, 1, -3, 4, -1, 2, 1, -5, 4]

Example Output

Output 1:

Output 2:

Example Explanation

Explanation 1:

The subarray [1, 2, 3, 4] has the maximum possible sum of 10.

Explanation 2:

The subarray [4,-1,2,1] has the maximum possible sum of 6.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Max Sum Contiguous Subarray on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Asked In:

Facebook
Paypal
Yahoo
Microsoft
LinkedIn
Amazon
Goldman Sachs
Deloitte
DE Shaw

Max Sum Contiguous Subarray

Discussion