Find the max possible sum from all contiguous subarrays of a given array
Given an array of integers, find the maximum possible sum you can get from one of its contiguous subarrays. The subarray from which this sum comes must contain at least 1 element. For inputArray = [-2, 2, 5, -11, 6], the output should be arrayMaxConsecutiveSum2(inputArray) = 7. The contiguous subarray that gives the maximum possible sum is [2, 5], with a sum of 7. Guaranteed constraints: 3 ≤ inputArray.length ≤ 105, -1000 ≤ inputArray[i] ≤ 1000. ...