comefrom: <awangdev>1007. Minimum Domino Rotations For Equal Row_3.java
code: private int count(int[] A, Integer candidate) {
  
          int count = 0;
          for (int num : A) count += (candidate == num) ? 1 : 0;
          return count;
      }
masked: private int sample_funcname ( int [ ] var_0 , Integer var_1 ) {
    int var_2 = 0 ;
    for ( int var_3 : var_0 ) var_2 += ( var_1 == var_3 ) ? 1 : 0 ;
    return var_2 ;
  }
  