title: Stuck with an interview Question... Partitioning of an Array
body: <p>I found the following problem on the internet, and would like to know how I would go about solving it:</p>
  
  <blockquote>
    <p><strong>Problem:</strong> Integer Partition without Rearrangement</p>
    
    <p><strong>Input:</strong> An arrangement S of non negative numbers {s<sub>1</sub>, . . .
    , s<sub>n</sub>} and an integer k.</p>
    
    <p><strong>Output:</strong> Partition S into k or fewer ranges, to minimize the maximum
    of the sums of all k or fewer ranges,
    without reordering any of the
    numbers.*</p>
  </blockquote>
  
  <p>Please help, seems like interesting question... I actually spend quite a lot time in it, but failed to see any solution.. </p>