Add solution #2208

JoshCrozier · JoshCrozier · commit 16da511649f2 · 2025-07-26T12:14:09.000-05:00
diff --git a/README.md b/README.md
@@ -2003,6 +2003,7 @@
 2204|[Distance to a Cycle in Undirected Graph](./solutions/2204-distance-to-a-cycle-in-undirected-graph.js)|Hard|
 2206|[Divide Array Into Equal Pairs](./solutions/2206-divide-array-into-equal-pairs.js)|Easy|
 2207|[Maximize Number of Subsequences in a String](./solutions/2207-maximize-number-of-subsequences-in-a-string.js)|Medium|
+2208|[Minimum Operations to Halve Array Sum](./solutions/2208-minimum-operations-to-halve-array-sum.js)|Medium|
 2209|[Minimum White Tiles After Covering With Carpets](./solutions/2209-minimum-white-tiles-after-covering-with-carpets.js)|Hard|
 2210|[Count Hills and Valleys in an Array](./solutions/2210-count-hills-and-valleys-in-an-array.js)|Easy|
 2211|[Count Collisions on a Road](./solutions/2211-count-collisions-on-a-road.js)|Medium|
diff --git a/solutions/2208-minimum-operations-to-halve-array-sum.js b/solutions/2208-minimum-operations-to-halve-array-sum.js
@@ -0,0 +1,39 @@
+/**
+ * 2208. Minimum Operations to Halve Array Sum
+ * https://leetcode.com/problems/minimum-operations-to-halve-array-sum/
+ * Difficulty: Medium
+ *
+ * You are given an array nums of positive integers. In one operation, you can choose any
+ * number from nums and reduce it to exactly half the number. (Note that you may choose
+ * this reduced number in future operations.)
+ *
+ * Return the minimum number of operations to reduce the sum of nums by at least half.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var halveArray = function(nums) {
+  const pq = new PriorityQueue((a, b) => b - a);
+  let totalSum = 0;
+
+  for (const num of nums) {
+    pq.enqueue(num);
+    totalSum += num;
+  }
+
+  const target = totalSum / 2;
+  let reducedSum = 0;
+  let result = 0;
+
+  while (reducedSum < target) {
+    const largest = pq.dequeue();
+    const halved = largest / 2;
+    reducedSum += halved;
+    pq.enqueue(halved);
+    result++;
+  }
+
+  return result;
+};
