Add solution #1338

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,238 LeetCode solutions in JavaScript
+# 1,239 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1015,6 +1015,7 @@
 1334|[Find the City With the Smallest Number of Neighbors at a Threshold Distance](./solutions/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.js)|Medium|
 1335|[Minimum Difficulty of a Job Schedule](./solutions/1335-minimum-difficulty-of-a-job-schedule.js)|Hard|
 1337|[The K Weakest Rows in a Matrix](./solutions/1337-the-k-weakest-rows-in-a-matrix.js)|Easy|
+1338|[Reduce Array Size to The Half](./solutions/1338-reduce-array-size-to-the-half.js)|Medium|
 1342|[Number of Steps to Reduce a Number to Zero](./solutions/1342-number-of-steps-to-reduce-a-number-to-zero.js)|Easy|
 1351|[Count Negative Numbers in a Sorted Matrix](./solutions/1351-count-negative-numbers-in-a-sorted-matrix.js)|Easy|
 1352|[Product of the Last K Numbers](./solutions/1352-product-of-the-last-k-numbers.js)|Medium|

solutions/1338-reduce-array-size-to-the-half.js

@@ -0,0 +1,35 @@
+/**
+ * 1338. Reduce Array Size to The Half
+ * https://leetcode.com/problems/reduce-array-size-to-the-half/
+ * Difficulty: Medium
+ *
+ * You are given an integer array arr. You can choose a set of integers and remove all the
+ * occurrences of these integers in the array.
+ *
+ * Return the minimum size of the set so that at least half of the integers of the array
+ * are removed.
+ */
+
+/**
+ * @param {number[]} arr
+ * @return {number}
+ */
+var minSetSize = function(arr) {
+  const map = new Map();
+  const halfLength = arr.length / 2;
+
+  arr.forEach(num => map.set(num, (map.get(num) || 0) + 1));
+
+  const frequencies = Array.from(map.values()).sort((a, b) => b - a);
+
+  let removedCount = 0;
+  let result = 0;
+
+  for (const freq of frequencies) {
+    removedCount += freq;
+    result++;
+    if (removedCount >= halfLength) break;
+  }
+
+  return result;
+};