update

Author: OneCodeMonkey

codeForces/Codeforces_1988A_Split_the_Multiset.java

@@ -0,0 +1,21 @@
+// Time: 281 ms 
+// Memory: 800 KB
+// Math.
+// T:O(t), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_1988A_Split_the_Multiset {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            int n = sc.nextInt(), k = sc.nextInt(), ret = 0;
+            if (n > 1) {
+                ret = (n - 1) % (k - 1) == 0 ? (n - 1) / (k - 1) : ((n - 1) / (k - 1) + 1);
+            }
+
+            System.out.println(ret);
+        }
+    }
+}

leetcode_solved/leetcode_3527_Find_the_Most_Common_Response.java

@@ -0,0 +1,29 @@
+// Runtime 171 ms Beats 24.09% 
+// Memory 190.59 MB Beats 69.91%
+// Map.
+// T:O(n), S:O(n) ~ O(nlogn)
+// 
+class Solution {
+    public String findCommonResponse(List<List<String>> responses) {
+        HashMap<String, Integer> record = new HashMap<>();
+        for (List<String> list : responses) {
+            HashSet<String> tmp = new HashSet<>(list);
+            for (String key : tmp) {
+                record.merge(key, 1, Integer::sum);
+            }
+        }
+        int maxFreq = 0;
+        for (String key : record.keySet()) {
+            maxFreq = Math.max(maxFreq, record.get(key));
+        }
+        List<String> keys = new ArrayList<>();
+        for (String key : record.keySet()) {
+            if (record.get(key) == maxFreq) {
+                keys.add(key);
+            }
+        }
+        Collections.sort(keys);
+
+        return keys.get(0);
+    }
+}