Add solution #1675

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,467 LeetCode solutions in JavaScript
+# 1,468 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1291,6 +1291,7 @@
 1672|[Richest Customer Wealth](./solutions/1672-richest-customer-wealth.js)|Easy|
 1673|[Find the Most Competitive Subsequence](./solutions/1673-find-the-most-competitive-subsequence.js)|Medium|
 1674|[Minimum Moves to Make Array Complementary](./solutions/1674-minimum-moves-to-make-array-complementary.js)|Medium|
+1675|[Minimize Deviation in Array](./solutions/1675-minimize-deviation-in-array.js)|Hard|
 1679|[Max Number of K-Sum Pairs](./solutions/1679-max-number-of-k-sum-pairs.js)|Medium|
 1716|[Calculate Money in Leetcode Bank](./solutions/1716-calculate-money-in-leetcode-bank.js)|Easy|
 1718|[Construct the Lexicographically Largest Valid Sequence](./solutions/1718-construct-the-lexicographically-largest-valid-sequence.js)|Medium|

solutions/1675-minimize-deviation-in-array.js

@@ -0,0 +1,65 @@
+/**
+ * 1675. Minimize Deviation in Array
+ * https://leetcode.com/problems/minimize-deviation-in-array/
+ * Difficulty: Hard
+ *
+ * You are given an array nums of n positive integers.
+ *
+ * You can perform two types of operations on any element of the array any number of times:
+ * - If the element is even, divide it by 2.
+ *   - For example, if the array is [1,2,3,4], then you can do this operation on the last element,
+ *     and the array will be [1,2,3,2].
+ * - If the element is odd, multiply it by 2.
+ *   - For example, if the array is [1,2,3,4], then you can do this operation on the first element,
+ *     and the array will be [2,2,3,4].
+ *
+ * The deviation of the array is the maximum difference between any two elements in the array.
+ *
+ * Return the minimum deviation the array can have after performing some number of operations.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var minimumDeviation = function(nums) {
+  const heap = [];
+  let minElement = Infinity;
+
+  for (const num of nums) {
+    const value = num % 2 ? num * 2 : num;
+    heap.push(value);
+    minElement = Math.min(minElement, value);
+  }
+
+  for (let i = Math.floor(heap.length / 2) - 1; i >= 0; i--) {
+    siftDown(i);
+  }
+
+  let minDeviation = heap[0] - minElement;
+
+  while (heap[0] % 2 === 0) {
+    const maxElement = heap[0];
+    heap[0] = maxElement / 2;
+    minElement = Math.min(minElement, heap[0]);
+    siftDown(0);
+    minDeviation = Math.min(minDeviation, heap[0] - minElement);
+  }
+
+  return minDeviation;
+
+  function siftDown(index) {
+    while (2 * index + 1 < heap.length) {
+      let maxChild = 2 * index + 1;
+      if (maxChild + 1 < heap.length && heap[maxChild + 1] > heap[maxChild]) {
+        maxChild++;
+      }
+      if (heap[index] < heap[maxChild]) {
+        [heap[index], heap[maxChild]] = [heap[maxChild], heap[index]];
+        index = maxChild;
+      } else {
+        break;
+      }
+    }
+  }
+};