algorithms.tutorialhorizon.com
Dynamic Programming - Maximum Subarray Problem | Algorithms
The maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array of numbers which has the largest sum.