Given an array of integers and an integer K, the objective is to determine the length of the longest subarray that sums exactly to K. A brute-force approach would check all subarrays, resulting in ...

is [4, -1, 2, 1], so the maximum subarray sum is 6. Kadane's algorithm is a simple dynamic programming algorithm that solves the maximum subarray sum problem in O(n) time and O(1) space.