<awangdev>1007. Minimum Domino Rotations For Equal Row_3.java
private int count(int[] A, Integer candidate) {

        int count = 0;
        for (int num : A) count += (candidate == num) ? 1 : 0;
        return count;
    }
private int sample_funcname ( int [ ] var_0 , Integer var_2 ) {
  int var_4 = 0 ;
  for ( int var_5 : var_0 ) var_4 += ( var_2 == var_5 ) ? 1 : 0 ;
  return var_4 ;
}
