comefrom: <doocs>0548.Split Array with Equal Sum_1.py
code: def splitArray( nums: List[int]) -> bool:
      n = len(nums)
      s = [0] * (n + 1)
      for i, v in enumerate(nums):
          s[i + 1] = s[i] + v
      for j in range(3, n - 3):
          seen = set()
          for i in range(1, j - 1):
              if s[i] == s[j] - s[i + 1]:
                  seen.add(s[i])
          for k in range(j + 2, n - 1):
              if s[n] - s[k + 1] == s[k] - s[j + 1] and s[n] - s[k + 1] in seen:
                  return True
      return False
masked: def sample_funcname ( var_0 : List [ int ] ) -> bool :
      var_5 = len ( var_0 )
      var_8 = [ 0 ] * ( var_5 + 1 )
      for var_10 , var_11 in enumerate ( var_0 ) :
          var_8 [ var_10 + 1 ] = var_8 [ var_10 ] + var_11
      for var_14 in range ( 3 , var_5 - 3 ) :
          var_16 = set ( )
          for var_10 in range ( 1 , var_14 - 1 ) :
              if var_8 [ var_10 ] == var_8 [ var_14 ] - var_8 [ var_10 + 1 ] :
                  var_16.add ( var_8 [ var_10 ] )
          for var_19 in range ( var_14 + 2 , var_5 - 1 ) :
              if var_8 [ var_5 ] - var_8 [ var_19 + 1 ] == var_8 [ var_19 ] - var_8 [ var_14 + 1 ] and var_8 [ var_5 ] - var_8 [ var_19 + 1 ] in var_16 :
                  return True
      return False
  