Max Sum Subarray #

• Implemented using Kadane’s algorithm in O(n).
• At each index determine the max subarray and take that as the current max to the next iteration