Add solution #1655

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,453 LeetCode solutions in JavaScript
+# 1,454 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1275,6 +1275,7 @@
 1652|[Defuse the Bomb](./solutions/1652-defuse-the-bomb.js)|Easy|
 1653|[Minimum Deletions to Make String Balanced](./solutions/1653-minimum-deletions-to-make-string-balanced.js)|Medium|
 1654|[Minimum Jumps to Reach Home](./solutions/1654-minimum-jumps-to-reach-home.js)|Medium|
+1655|[Distribute Repeating Integers](./solutions/1655-distribute-repeating-integers.js)|Hard|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|
 1669|[Merge In Between Linked Lists](./solutions/1669-merge-in-between-linked-lists.js)|Medium|

solutions/1655-distribute-repeating-integers.js

@@ -0,0 +1,46 @@
+/**
+ * 1655. Distribute Repeating Integers
+ * https://leetcode.com/problems/distribute-repeating-integers/
+ * Difficulty: Hard
+ *
+ * You are given an array of n integers, nums, where there are at most 50 unique values in
+ * the array. You are also given an array of m customer order quantities, quantity, where
+ * quantity[i] is the amount of integers the ith customer ordered. Determine if it is possible
+ * to distribute nums such that:
+ * - The ith customer gets exactly quantity[i] integers,
+ * - The integers the ith customer gets are all equal, and
+ * - Every customer is satisfied.
+ *
+ * Return true if it is possible to distribute nums according to the above conditions.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number[]} quantity
+ * @return {boolean}
+ */
+var canDistribute = function(nums, quantity) {
+  const frequencyMap = new Map();
+  for (const num of nums) {
+    frequencyMap.set(num, (frequencyMap.get(num) || 0) + 1);
+  }
+
+  const frequencies = Array.from(frequencyMap.values()).sort((a, b) => b - a);
+  quantity.sort((a, b) => b - a);
+
+  return canSatisfy(0, frequencies);
+
+  function canSatisfy(index, counts) {
+    if (index === quantity.length) return true;
+
+    for (let i = 0; i < counts.length; i++) {
+      if (counts[i] >= quantity[index]) {
+        counts[i] -= quantity[index];
+        if (canSatisfy(index + 1, counts)) return true;
+        counts[i] += quantity[index];
+      }
+    }
+
+    return false;
+  }
+};