1217. Minimum Cost to Move Chips to The Same Position

class Solution {
    public int minCostToMoveChips(int[] position) {
        int odd = 0, even = 0;

        for (int index : position) {
            if ((index & 1) == 1) {
                odd++;
            } else {
                even++;
            }
        }

        return Math.min(odd, even);
    }
}

References

1217. Minimum Cost to Move Chips to The Same Position