title: Get max subsum from an array
body: <p>I had this question on a test recently and don't understand at all what the question is asking for, especially based on the examples:</p>
  
  <blockquote>
    <p><strong>max_subsum</strong></p>
    
    <p>Write a method, max_subsum(numbers), which takes an array and returns
    the start and end    indices of the consecutive range which has the
    largest sum.</p>
    
    <p>max_subsum([100, -101, 200, -3, 1000]) == [2, 4]</p>
    
    <p>max_subsum([1, 2, 3]) == [0, 2]</p>
    
    <p>Hints: iterate through all the subarrays; compute the sum of each
    subarray and compare to the max subsum seen so far. A subarray is
    defined by its start index and end indices, so iterate through all
    pairs of indices. You should probably use two loops, one nested inside
    the other.</p>
  </blockquote>
  
  <p>I don't see any subarrays in the examples. The output from the examples simply shows the indices of smallest and largest values in the array. If that's what the question is asking for, then what summation of subarrays is happening. I must be missing something simple, I just don't know what that is. Does someone else see it?</p>