Maximum Subarray Sum: Kadanes Algorithm (Dynamic Programming)

Problem: We have to find the maximum subarray sum. Eg: Lets consider this array ⇒ -10, 5, -9, 1, 3, -2, 3, 4, 7, 2, -9, 6, 3, 1, -5, -4, the answer for maximum subarray sum is 19. (1, 3, -2, 3, 4, 7, 2, -9, 6, 3, 1) Solution