<gouthampradhan>hashing_ContiguousArray_1.java
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;
  }
public int sample_funcname ( int [ ] var_0 ) {
  Map < Integer , Integer > var_4 = new HashMap < > ( ) ;
  int var_6 = 0 ;
  int max = 0 ;
  for ( int var_8 = 0 ;
  var_8 < var_0 . length ;
  var_8 ++ ) {
    if ( var_0 [ var_8 ] == 0 ) {
      var_6 -- ;
    }
    else var_6 ++ ;
    if ( var_6 == 0 ) {
      max = Math . max ( max , var_8 + 1 ) ;
    }
    else {
      if ( var_4 . containsKey ( var_6 ) ) {
        int var_14 = var_4 . get ( var_6 ) ;
        max = Math . max ( max , var_8 - var_14 ) ;
      }
      else {
        var_4 . put ( var_6 , var_8 ) ;
      }
    }
  }
  return max ;
}
