This website contains ALL LeetCode **Premium** problems for
**FREE!!**.

All leaked interview problems are collected from Internet.

All leaked interview problems are collected from Internet.

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`

.

If you have figured out the O(*n*) solution, try coding another solution using the divide and conquer approach, which is more subtle.

b''