Challenge: Maximum Sum Subarray

Maximum subarray sum: An overview

Given an unsorted array $A$, the maximum sum subarray is the subarray (contiguous elements) from $A$ for which the sum of the elements is maximum. In this challenge, we want to find the sum of the maximum sum subarray. This problem is a tricky one because the array might have negative integers in any position, so we have to cater to those negative integers while choosing the continuous subarray with the largest positive values.

Here is an example: