add 2244

fishercoder1534 · fishercoder1534 · commit b76f9711af69 · 2022-04-16T21:16:29.000-07:00
diff --git a/README.md b/README.md
@@ -8,13 +8,14 @@ _If you like this project, please leave me a star._ &#9733;
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty  | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------
-| 2243 |[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2243.java)                                                                      || Easy                                                                          ||
+| 2244 |[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2244.java)                                                                     || Medium                                                                        ||
+| 2243 |[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2243.java)                                                                     || Easy                                                                          ||
 | 2220 |[Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2220.java)                                                                     || Easy                                                                          ||
 | 2215 |[Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2215.java)                                                                     || Easy                                                                          ||
 | 2210 |[Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2210.java)                                                                     || Easy                                                                          ||
-| 2208 |[Minimum Operations to Halve Array Sum](https://leetcode.com/problems/minimum-operations-to-halve-array-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2208.java)                                                                     || Medium                                                                          ||
+| 2208 |[Minimum Operations to Halve Array Sum](https://leetcode.com/problems/minimum-operations-to-halve-array-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2208.java)                                                                     || Medium                                                                        ||
 | 2206 |[Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2206.java)                                                                     || Easy                                                                          ||
-| 2201 |[Count Artifacts That Can Be Extracted](https://leetcode.com/problems/count-artifacts-that-can-be-extracted/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2201.java)                                                                     || Medium                                                                          ||
+| 2201 |[Count Artifacts That Can Be Extracted](https://leetcode.com/problems/count-artifacts-that-can-be-extracted/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2201.java)                                                                     || Medium                                                                        ||
 | 2200 |[Find All K-Distant Indices in an Array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2200.java)                                                                     || Easy                                                                          ||
 | 2194 |[Cells in a Range on an Excel Sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2194.java)                                                                     || Easy                                                                          ||
 | 2190 |[Most Frequent Number Following Key In an Array](https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2190.java)                                                                     || Easy                                                                          ||
diff --git a/src/main/java/com/fishercoder/solutions/_2244.java b/src/main/java/com/fishercoder/solutions/_2244.java
@@ -0,0 +1,31 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _2244 {
+    public static class Solution1 {
+        public int minimumRounds(int[] tasks) {
+            Map<Integer, Integer> map = new HashMap<>();
+            for (int task : tasks) {
+                map.put(task, map.getOrDefault(task, 0) + 1);
+            }
+            int rounds = 0;
+            for (int task : map.keySet()) {
+                int count = map.get(task);
+                if (count == 2 || count == 3) {
+                    rounds++;
+                } else if (count == 1) {
+                    return -1;
+                } else {
+                    if (count % 3 == 0) {
+                        rounds += count / 3;
+                    } else {
+                        rounds += (count / 3 + 1);
+                    }
+                }
+            }
+            return rounds;
+        }
+    }
+}
