Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array
the contiguous subarray
[4,-1,2,1] has the largest sum =
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
Subscribe to see which companies asked this question.