Python fast solution with explanation
\nclass Solution:\n    def largestWordCount(self, messages: List[str], senders: List[str]) -> str:\n        \n        # total will contain total sum of sender\'
```\nclass Solution:\n    def largestWordCount(self, messages: List[str], senders: List[str]) -> str:\n        \n        # total will contain total sum of sender\'s words                   \n        total = {}\n        max_name = \'\'\n        max_value = 0\n        \n        for i in range(len(senders)):\n            # get num of words in message             \n            words_num = len(messages[i].split(\' \'))\n            \n            # if total contain sender\'s name\n            # we add words_num to its value    \n            # else add new key              \n            if total.get(senders[i], None):\n                total[senders[i]] += words_num\n            else:\n                total[senders[i]] = words_num\n                \n            # if max_num of words is equal to sender\'s total words num\n            # and max_name is less then sender\'s name we change max_name        \n            if total[senders[i]]==max_value and max_name<senders[i]:\n                max_name = senders[i]\n            \n            # if sender\'s total words num is greater then current max\n            # we save its name and num of words          \n            elif total[senders[i]]>max_value:\n                max_value = total[senders[i]]\n                max_name = senders[i]\n        return max_name\n                \n```
['Python']