1
class Solution:
2
    def largestWordCount(self, messages: List[str], senders: List[str]) -> str:
3
        d = {}
4
        l = []
5
        for i in range(len(messages)):
6
            if senders[i] not in d:
7
                d[senders[i]] = len(messages[i].split())
8
            else:
9
                d[senders[i]] += len(messages[i].split())
10
        x = max(d.values())
11
        for k, v in d.items():
12
            if v == x:
13
                l.append(k)
14
        if len(l) == 1:
15
            return l[0]
16
        else:
17
            l = sorted(l)[::-1]  # Lexigograhical sorting of list
18
            return l[0]