Java Solution with HashMap
\nclass Solution {\n    public String largestWordCount(String[] messages, String[] senders) {\n        Map<String, Integer> map = new HashMap<>();\n        \n  
```\nclass Solution {\n    public String largestWordCount(String[] messages, String[] senders) {\n        Map<String, Integer> map = new HashMap<>();\n        \n        for (int i = 0; i < messages.length; i++) {\n            String message = messages[i];\n            String[] words = message.split(" ");\n            map.put(senders[i], map.getOrDefault(senders[i], 0) + words.length);\n        }\n        \n        int maxValue = Integer.MIN_VALUE;\n        String result = "";\n        \n        for (Map.Entry<String, Integer> entry : map.entrySet()) {\n            String key = entry.getKey();\n            int value = entry.getValue();\n            if (value > maxValue) {\n                maxValue = value;\n                result = key;\n                continue;\n            }\n            if (value == maxValue && key.compareTo(result) > 0) {\n                result = key;\n                continue;\n            }\n        }\n        return result;\n    }\n}\n```
['Java']