title: Subsequence with maximum sum in array of ints
body: <p>Given an array of integers, how can you find two indices, i and j, such that the sum of the elements in the subarray starting and ending at the indices is maximized, <strong>in linear time</strong>?</p>