Decoding Dynamic Programming

The problem asks us to find a particular subarray from the list of sub-arrays with the maximum sum. A simple solution to the problem is to find the value of sum for each sub array and from that, we will return the subarray S. It is very easy to code in python to print all possible contiguous sub arrays from the array A. The code is well-documented and easy to read in the comments after each line of code. We just need to make some simple modifications in the previous code.