Python Easy Solution using Hashing and Sorting
```\nclass Solution:\n    def largestWordCount(self, messages: List[str], senders: List[str]) -> str:\n        mapping, res = {}, []\n        \n        for i, s
```\nclass Solution:\n    def largestWordCount(self, messages: List[str], senders: List[str]) -> str:\n        mapping, res = {}, []\n        \n        for i, sender in enumerate(senders):\n            if sender not in mapping:\n                mapping[sender] = len(messages[i].split())\n            else:\n                mapping[sender] += len(messages[i].split())\n                \n        mapping = {val[0] : val[1] for val in sorted(mapping.items(), key = lambda x: (-x[1], x[0]))}\n        max_val = max(mapping.values())\n        \n        for k, v in mapping.items():\n            if v == max_val:\n                res.append(k)\n                \n        if len(res) == 1:\n            return res[0]\n        \n        res.sort(key = len)\n        res.sort(key = str)\n        \n        return res[-1]
['Sorting', 'Python', 'Python3']