Max Sum Contiguous Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example:

Given the array [-2,1,-3,4,-1,2,1,-5,4],

the contiguous subarray [4,-1,2,1] has the largest sum = 6.

For this problem, return the maximum sum.

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 doubt? Checkout Sample Codes for more details.
Start solving Max Sum Contiguous Subarray on Interview Code Editor
Sign Up
to access hints and editorial solutions for Max Sum Contiguous Subarray
Asked In:
  • Facebook
  • Paypal
  • Yahoo
  • Microsoft
  • LinkedIn
Click here to start solving coding interview questions