Largest Sum Subarray

Statement

Given an array, find the contiguous subarray with the largest sum. Return the largest sum. Remember that a subarray contains at least one number.

Note: A subarray is a contiguous part of an array.

Example

In the array below, the largest sum subarray starts at index $3$ and ends at $6$, which yields a sum of $12$.