#If there is a list of random number elements consists of n positive integers such that the digits #in each element of list do not exceed 2. Find the sum of all numbers which consists of digit 5 in ...

The maximum sum subarray problem consists in finding the maximum sum of a contiguous subsequence in an array or list of integers: maxSequence([-2, 1, -3, 4, -1, 2, 1, -5, 4]) # should be 6: [4, -1, 2, ...