add 2284

fishercoder1534 · fishercoder1534 · commit 4c413a53c0a3 · 2022-05-28T10:03:54.000-07:00
diff --git a/README.md b/README.md
@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ &#9733;
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty  | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------
-| 2283 |[Check if Number Has Equal Digit Count and Digit Value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2283.java)                                                                      || Easy                                                                          ||
+| 2284 |[Sender With Largest Word Count](https://leetcode.com/problems/sender-with-largest-word-count/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2284.java)                                                                     || Medium                                                                        ||
+| 2283 |[Check if Number Has Equal Digit Count and Digit Value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2283.java)                                                                     || Easy                                                                          ||
 | 2279 |[Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2279.java)                                                                     || Medium                                                                        ||
 | 2278 |[Percentage of Letter in String](https://leetcode.com/problems/percentage-of-letter-in-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2278.java)                                                                     || Easy                                                                          ||
 | 2270 |[Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2270.java)                                                                     || Medium                                                                        ||
diff --git a/src/main/java/com/fishercoder/solutions/_2284.java b/src/main/java/com/fishercoder/solutions/_2284.java
@@ -0,0 +1,31 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _2284 {
+    public static class Solution1 {
+        public String largestWordCount(String[] messages, String[] senders) {
+            Map<String, Integer> map = new HashMap<>();
+            for (int i = 0; i < messages.length; i++) {
+                String sender = senders[i];
+                int count = messages[i].split(" ").length;
+                Integer existing = map.getOrDefault(sender, 0);
+                map.put(sender, existing + count);
+            }
+            int max = 0;
+            String result = "";
+            for (String sender : map.keySet()) {
+                if (map.get(sender) > max) {
+                    max = map.get(sender);
+                    result = sender;
+                } else if (map.get(sender) == max) {
+                    if (result.compareTo(sender) < 0) {
+                        result = sender;
+                    }
+                }
+            }
+            return result;
+        }
+    }
+}
