wholesale designer clothing lots
I solved the maximum sum contiguous subarray problem on Interviewbit in Ruby. The problem is as follows: Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example: Given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] has the largest sum = 6.