Maximum Size Subarray Sum Equals K
Problem statement
Given an integer array nums and an integer k, return the maximum length of a contiguous nonempty subarray whose elements sum to k.
Return 0 if no such subarray exists.
Function
maxSubArrayLen(nums: int[], k: int) → intExamples
Example 1
nums = [1,-1,5,-2,3]k = 3return = 4The subarray [1,-1,5,-2] sums to 3.
Example 2
nums = [-2,-1,2,1]k = 1return = 2The subarray [-1,2] has length 2 and sum 1.
Constraints
1 <= nums.length <= 2 * 10^5.- Values and prefix sums fit in a 64-bit signed integer.