Array Consecutive Sum

Problem Statement : 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. int solution(int[] inputArray) { int maxSum =...