Python Easy Approach
The pseudo code is as follows:\n1. Find the word count tally for each sender. \n2. Find the max word count.\n3. Find lexicographically larger sender name if the
The pseudo code is as follows:\n1. Find the word count tally for each sender. \n2. Find the max word count.\n3. Find lexicographically larger sender name if there are more than one senders with same max word count.\n\nMy implementation is as follows:\n```\nclass Solution:\n    def largestWordCount(self, messages: List[str], senders: List[str]) -> str:\n        counter = defaultdict(int)\n        max_count = -math.inf\n        res=\'\'\n        # find the word count tally for each sender\n        for message, sender in zip(messages, senders):            \n            counter[sender]+=len(message.split(\' \'))\n            \n            if counter[sender]>=max_count:\n                # pick lexicographically larger name in case same word count\n                if max_count<counter[sender] or sender>res: \n                    res=sender\n                max_count=counter[sender]                                       \n        \n        return res                                             \n```\n**Time - O(n)**\n**Space - O(n)** - space to store the `counter` dict\n\n---\n\n***Please upvote if you find it useful***
['Python', 'Python3']