comefrom: <doocs>0325.Maximum Size Subarray Sum Equals k_1.py
code: 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
masked: def sample_funcname ( var_0 : List [ int ] , var_1 : int ) -> int :
      var_2 = { 0 : - 1 }
      var_4 = var_3 = 0
      for var_5 , var_6 in enumerate ( var_0 ) :
          var_4 += var_6
          if var_4 - var_1 in var_2 :
              var_3 = max ( var_3 , var_5 - var_2 [ var_4 - var_1 ] )
          if var_4 not in var_2 :
              var_2 [ var_4 ] = var_5
      return var_3
  