Kadane's Algorithm is used to find the maximum sum of a contiguous subarray within a one-dimensional array of numbers
-
Example:
- The maximum sum of the array [-2, 1, -3, 4, -1, 2, 1, -5, 4] is 6 {subarray being [4, -1, 2, 1] }.
-
Used Recursion and solved ques via recursion