A crate to efficiently find the maximum subarray sum in a list.
Time Complexity:
O(N)
Space complexity:
O(1)