2025-08-02 12:56:06 +0000 UTC

Minimum Cost to Move Chips to The Same Position
Categories:
Tags:

Code

class Solution:
    def minCostToMoveChips(self, position: List[int]) -> int:
        length = len(position)
        odd, even = 0, 0
        for pos in position:
            if pos % 2 == 0:
                even += 1
            else:
                odd += 1
        return min(odd, even)