Mid/Senior
Maximum Size Subarray Sum Equals k
Given an integer array nums and an integer k, return the maximum length of a contiguous subarray whose elements sum to k.
If there is no such subarray, return 0.
Your solution should run in O(n) time.
Example 1
Input
nums = [1,-1,5,-2,3], k = 3Output
4The subarray
[1, -1, 5, -2] sums to 3 and has length 4, which is the maximum possible length.Example 2
Input
nums = [-2,-1,2,1], k = 1Output
2The subarray
[-1, 2] sums to 1 and has length 2, which is the maximum possible length.Constraints
- 1 <= nums.length <= 2 * 10^5
- -10^4 <= nums[i] <= 10^4
- -10^9 <= k <= 10^9