Add solution #1217

Author: JoshCrozier

1217-minimum-cost-to-move-chips-to-the-same-position.js

@@ -0,0 +1,23 @@
+/**
+ * 1217. Minimum Cost to Move Chips to The Same Position
+ * https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/
+ * Difficulty: Easy
+ *
+ * We have n chips, where the position of the ith chip is position[i].
+ *
+ * We need to move all the chips to the same position. In one step, we can change the position
+ * of the ith chip from position[i] to:
+ * - position[i] + 2 or position[i] - 2 with cost = 0.
+ * - position[i] + 1 or position[i] - 1 with cost = 1.
+ *
+ * Return the minimum cost needed to move all the chips to the same position.
+ */
+
+/**
+ * @param {number[]} position
+ * @return {number}
+ */
+var minCostToMoveChips = function(position) {
+  const count = position.reduce((result, n) => n % 2 ? ++result : result, 0);
+  return count >= position.length / 2 ? position.length - count : count;
+};

README.md

@@ -323,6 +323,7 @@
 1122|[Relative Sort Array](./1122-relative-sort-array.js)|Easy|
 1189|[Maximum Number of Balloons](./1189-maximum-number-of-balloons.js)|Easy|
 1207|[Unique Number of Occurrences](./1207-unique-number-of-occurrences.js)|Easy|
+1217|[Minimum Cost to Move Chips to The Same Position](./1217-minimum-cost-to-move-chips-to-the-same-position.js)|Easy|
 1232|[Check If It Is a Straight Line](./1232-check-if-it-is-a-straight-line.js)|Easy|
 1233|[Remove Sub-Folders from the Filesystem](./1233-remove-sub-folders-from-the-filesystem.js)|Medium|
 1249|[Minimum Remove to Make Valid Parentheses](./1249-minimum-remove-to-make-valid-parentheses.js)|Medium|