C++ easy solution
\nclass Solution {\npublic:\n    string largestWordCount(vector<string>& messages, vector<string>& senders) {\n        unordered_map<string,int> mpp;\n        s
```\nclass Solution {\npublic:\n    string largestWordCount(vector<string>& messages, vector<string>& senders) {\n        unordered_map<string,int> mpp;\n        string temp="";\n        int j;\n        for(int i=0;i<senders.size();i++)\n        {\n             for(j=0;j<messages[i].size();j++)\n             {\n                 if(messages[i][j]==\' \')\n                     mpp[senders[i]]++;\n             }\n             if(j==messages[i].size())\n                 mpp[senders[i]]++;\n        }\n        \n        int maxfreq=INT_MIN;\n        for(auto it:mpp)\n        {\n            if(maxfreq < it.second)\n            {\n                maxfreq=it.second;\n                temp=it.first;\n            }\n        }\n        \n        for(auto it:mpp)\n        {\n            if(it.second==maxfreq && temp < it.first)\n            {\n                temp=it.first;\n            }\n        }\n        return temp;\n    }\n};\n```
[]