c++ | easy | short
\nclass Solution {\npublic:\n    string largestWordCount(vector<string>& messages, vector<string>& senders) \n{\n    unordered_map<string,int>mp;\n    int size 
```\nclass Solution {\npublic:\n    string largestWordCount(vector<string>& messages, vector<string>& senders) \n{\n    unordered_map<string,int>mp;\n    int size = messages.size();\n    \n    for(int i=0;i<size;i++)\n    {\n    \tstring str = messages[i];\n    \t\n    \tint idx=0;\n    \t\n    \twhile(idx<str.length())\n    \t{\n            string s="";\n    \t\twhile(idx<str.length() and ((str[idx]>=\'a\' and str[idx]<=\'z\') or (str[idx]>=\'A\' and str[idx]<=\'Z\')))\n    \t\t{\n    \t\t\t s.push_back(str[idx]);\n    \t\t\t idx++;\n\t\t\t}\n\t\t\tmp[senders[i]]=mp[senders[i]]+1;\n\t\t\twhile(idx<str.length() and (str[idx]==\' \'))\n\t\t\t{\n\t\t\t\tidx++;\n\t\t\t}\n\t\t}\n\t}\n\tint val = INT_MIN;\n\tfor(auto it=mp.begin();it!=mp.end();it++)\n\t{\n\t\tif(it->second > val)\n\t\t{\n\t\t\tval = it->second;\n\t\t}\n\t}\n\tstring ans="";\n\tfor(auto it=mp.begin();it!=mp.end();it++)\n\t{\n\t\tif(it->second == val and it->first > ans)\n\t\t{\n\t\t\tans=it->first;\n\t\t}\n\t}\n\treturn ans;\n}\n};\n```
['C', 'C++']