Add solution #2244

Author: JoshCrozier

README.md

@@ -285,6 +285,7 @@
 2099|[Find Subsequence of Length K With the Largest Sum](./2099-find-subsequence-of-length-k-with-the-largest-sum.js)|Medium|
 2114|[Maximum Number of Words Found in Sentences](./2114-maximum-number-of-words-found-in-sentences.js)|Easy|
 2129|[Capitalize the Title](./2129-capitalize-the-title.js)|Easy|
+2244|[Minimum Rounds to Complete All Tasks](./2244-minimum-rounds-to-complete-all-tasks.js)|Medium|
 2427|[Number of Common Factors](./2427-number-of-common-factors.js)|Easy|
 
 ## License

solutions/2244-minimum-rounds-to-complete-all-tasks.js

@@ -0,0 +1,31 @@
+/**
+ * 2244. Minimum Rounds to Complete All Tasks
+ * https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/
+ * Difficulty: Medium
+ *
+ * You are given a 0-indexed integer array tasks, where tasks[i] represents the difficulty level
+ * of a task. In each round, you can complete either 2 or 3 tasks of the same difficulty level.
+ *
+ * Return the minimum rounds required to complete all the tasks, or -1 if it is not possible to
+ * complete all the tasks.
+ */
+
+/**
+ * @param {number[]} tasks
+ * @return {number}
+ */
+var minimumRounds = function(tasks) {
+  const map = new Map();
+  let result = 0;
+
+  tasks.forEach(task => map.set(task, map.has(task) ? map.get(task) + 1 : 1));
+
+  for (const count of map.values()) {
+    if (count < 2) {
+      return -1;
+    }
+    result += Math.floor(count / 3) + (count % 3 === 0 ? 0 : 1);
+  }
+
+  return result;
+};