Create Minimum Cost to Move Chips to The Same Position.java

varunu28 · web-flow · commit 5632d7dea94d · 2021-12-06T09:38:30.000-08:00
diff --git a/Easy/Minimum Cost to Move Chips to The Same Position.java b/Easy/Minimum Cost to Move Chips to The Same Position.java
@@ -0,0 +1,14 @@
+class Solution {
+  public int minCostToMoveChips(int[] position) {
+    int evenCount = 0;
+    int oddCount = 0;
+    for (int p : position) {
+      if (p % 2 == 0) {
+        evenCount++;
+      } else {
+        oddCount++;
+      }
+    }
+    return Math.min(evenCount, oddCount);
+  }
+}
