Kadane's algorithm is a dynamic programming approach to the maximum subarray problem, that is, is the task of finding the contiguous subarray within a one-dimensional array of numbers (containing at least one positive number) which has the largest sum.
For example, we have {2,2,-1}, when k = 0, return -1. when k = 3, return 3. This is even tricky because we have negative …
algorithm queue dynamic-programming binary-search kadanes-algorithm