<doocs>0325.Maximum Size Subarray Sum Equals k_1.py
def maxSubArrayLen( nums: List[int], k: int) -> int:
    mp = {0: -1}
    s = ans = 0
    for i, v in enumerate(nums):
        s += v
        if s - k in mp:
            ans = max(ans, i - mp[s - k])
        if s not in mp:
            mp[s] = i
    return ans
def sample_funcname ( var_0 : List [ int ] , var_3 : int ) -> int :
    var_6 = { 0 : - 1 }
    var_8 = var_7 = 0
    for var_10 , var_11 in enumerate ( var_0 ) :
        var_8 += var_11
        if var_8 - var_3 in var_6 :
            var_7 = max ( var_7 , var_10 - var_6 [ var_8 - var_3 ] )
        if var_8 not in var_6 :
            var_6 [ var_8 ] = var_10
    return var_7
