Given an unsorted array of numbers, compute the largest contiguous subset sum in the array.

What is the largest contiguous sum in the text.

**Details and Assumptions**

For example in the array `[2, -2, -1, 5, 4]`

the largest such sum is \(9\)....`[5,4]`

Here is an easier problem.