input: Write a python function to find the maximum length subarray with sum zero.
  assert findMaxSubArray([1, 0, 1, 0, 0, 1, 1, 0]) == 4
  assert findMaxSubArray([1, 2, -3, 4, -4, 5, -5]) == 7
  assert findMaxSubArray([1, 2, 3, -6, 4, 2, -2]) == 6
output: def findMaxSubArray(arr):
      sum_map = {}
      max_len = 0
      curr_sum = 0
  
      for i in range(len(arr)):
          curr_sum += arr[i]
  
          if curr_sum == 0:
              max_len = i + 1
  
          if curr_sum in sum_map:
              max_len = max(max_len, i - sum_map[curr_sum])
          else:
              sum_map[curr_sum] = i
  
      return max_len