Minimum Cost to Move Chips to The Same Position LeetCode solution in Python

1
class Solution:
2
    def minCostToMoveChips(self, position: List[int]) -> int:
3
        count_even = 0
4
        count_odd = 0
5
        for i in position:
6
            if i % 2 == 0:
7
                count_even += 1
8
            else:
9
                count_odd += 1
10
        return min(count_even, count_odd)