https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/ Easy

Решение

fun minCostToMoveChips(position: IntArray): Int {
    var even = 0
    var odd = 0

    for (pos in position) {
        if (pos % 2 == 0) even++ else odd++
    }

    return minOf(even, odd)
}