Problem link: https://leetcode.com/problems/maximum-subarray/ The purpose of the problem is find the max sum of contiguous values in an array. Here are a couple example inputs and outputs: Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6. Input: [-2,-11,-13,-2,-14,-9,-5,-15,-3],
Output: -2
Explanation: [-2] has the largest sum = -2…