comefrom: <gouthampradhan>hashing_ContiguousArray_1.java
code: public int findMaxLength(int[] nums) {
      Map<Integer, Integer> map = new HashMap<>();
      int count = 0;
      int max = 0;
      for (int i = 0; i < nums.length; i++) {
        if (nums[i] == 0) {
          count--;
        } else count++;
        if (count == 0) {
          max = Math.max(max, i + 1);
        } else {
          if (map.containsKey(count)) {
            int index = map.get(count);
            max = Math.max(max, i - index);
          } else {
            map.put(count, i);
          }
        }
      }
      return max;
    }
masked: public int sample_funcname ( int [ ] var_0 ) {
    Map < Integer , Integer > var_1 = new HashMap < > ( ) ;
    int var_2 = 0 ;
    int max = 0 ;
    for ( int var_3 = 0 ;
    var_3 < var_0 . length ;
    var_3 ++ ) {
      if ( var_0 [ var_3 ] == 0 ) {
        var_2 -- ;
      }
      else var_2 ++ ;
      if ( var_2 == 0 ) {
        max = Math . max ( max , var_3 + 1 ) ;
      }
      else {
        if ( var_1 . containsKey ( var_2 ) ) {
          int var_4 = var_1 . get ( var_2 ) ;
          max = Math . max ( max , var_3 - var_4 ) ;
        }
        else {
          var_1 . put ( var_2 , var_3 ) ;
        }
      }
    }
    return max ;
  }
  