C++ || MAP || Easy
\nclass Solution {\npublic:\n    string largestWordCount(vector<string>& messages, vector<string>& senders){\n        map<string, int> mp;\n        for(int i = 
```\nclass Solution {\npublic:\n    string largestWordCount(vector<string>& messages, vector<string>& senders){\n        map<string, int> mp;\n        for(int i = 0; i<messages.size(); ++i){\n            int words = count(begin(messages[i]), end(messages[i]), \' \')+1;\n            mp[senders[i]]+=words;\n        }\n        string ans = "";\n        int count = 0;\n        for(auto it = mp.begin(); it!=mp.end(); ++it){\n            if(it->second >= count){\n                count = it->second;\n                ans = it->first;\n            }\n        }\n        return ans;\n    }\n};\n```
['C']