comefrom: <gouthampradhan>math_SuperWashingMachines_1.java
code: public int findMinMoves(int[] machines) {
      long sum = Arrays.stream(machines).asLongStream().sum();
      if (((sum / machines.length) < 0) || ((sum % machines.length) != 0)) return -1;
      int n = (int) (sum / machines.length);
      int count = 0, moves = Integer.MIN_VALUE;
      for (int i = 0; i < machines.length; i++) {
        count += (machines[i] - n);
        moves = Math.max(moves, Math.max(Math.abs(count), (machines[i] - n)));
      }
      return moves;
    }
masked: public int sample_funcname ( int [ ] var_0 ) {
    long sum = Arrays . stream ( var_0 ) . asLongStream ( ) . sum ( ) ;
    if ( ( ( sum / var_0 . length ) < 0 ) || ( ( sum % var_0 . length ) != 0 ) ) return - 1 ;
    int var_8 = ( int ) ( sum / var_0 . length ) ;
    int var_9 = 0 , var_12 = Integer . MIN_VALUE ;
    for ( int var_13 = 0 ;
    var_13 < var_0 . length ;
    var_13 ++ ) {
      var_9 += ( var_0 [ var_13 ] - var_8 ) ;
      var_12 = Math . max ( var_12 , Math . max ( Math . abs ( var_9 ) , ( var_0 [ var_13 ] - var_8 ) ) ) ;
    }
    return var_12 ;
  }
  