Add solution #2226

Author: JoshCrozier

README.md

@@ -792,6 +792,7 @@
 2161|[Partition Array According to Given Pivot](./2161-partition-array-according-to-given-pivot.js)|Medium|
 2185|[Counting Words With a Given Prefix](./2185-counting-words-with-a-given-prefix.js)|Easy|
 2215|[Find the Difference of Two Arrays](./2215-find-the-difference-of-two-arrays.js)|Easy|
+2226|[Maximum Candies Allocated to K Children](./2226-maximum-candies-allocated-to-k-children.js)|Medium|
 2235|[Add Two Integers](./2235-add-two-integers.js)|Easy|
 2244|[Minimum Rounds to Complete All Tasks](./2244-minimum-rounds-to-complete-all-tasks.js)|Medium|
 2270|[Number of Ways to Split Array](./2270-number-of-ways-to-split-array.js)|Medium|

solutions/2226-maximum-candies-allocated-to-k-children.js

@@ -0,0 +1,40 @@
+/**
+ * 2226. Maximum Candies Allocated to K Children
+ * https://leetcode.com/problems/maximum-candies-allocated-to-k-children/
+ * Difficulty: Medium
+ *
+ * You are given a 0-indexed integer array candies. Each element in the array denotes a pile of
+ * candies of size candies[i]. You can divide each pile into any number of sub piles, but you
+ * cannot merge two piles together.
+ *
+ * You are also given an integer k. You should allocate piles of candies to k children such that
+ * each child gets the same number of candies. Each child can be allocated candies from only one
+ * pile of candies and some piles of candies may go unused.
+ *
+ * Return the maximum number of candies each child can get.
+ */
+
+/**
+ * @param {number[]} candies
+ * @param {number} k
+ * @return {number}
+ */
+var maximumCandies = function(candies, k) {
+  let left = 0;
+  let right = 1e7 + 1;
+
+  while (left + 1 !== right) {
+    const middle = Math.floor((left + right) / 2);
+    let piles = 0;
+    for (const candy of candies) {
+      piles += Math.floor(candy / middle);
+    }
+    if (piles >= k) {
+      left = middle;
+    } else {
+      right = middle;
+    }
+  }
+
+  return left;
+};