def FindGreatestSumOfSubArray(self , array: List[int]) -> List[int]: # write code here maxSum, maxStart, maxEnd = array[0], 0, 0 currSum, currStart, currEnd = array[0], 0, 0 for i in range(1, len(array)): if currSum + array[i] >= array[i]: currSum += array[i] currEnd += 1 else: currSum = array...