What is the maximum subarray sum problem and how do you solve it?

Question Explain

This problem asks for the contiguous subarray within a one-dimensional array that has the largest sum. It is a fundamental test of Kadane's Algorithm.