#1217 Minimum Cost to Move Chips to the Same Position.java

//https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/
class Solution {
    public int minCostToMoveChips(int[] position) {
       int even = 0 , odd = 0;
       for(int i : position) {
           if(i % 2 == 0) even++;
           else odd++;
       }
       return Math.min(odd,even); 
    }
}