C++ || no use of StringStream
\nclass Solution {\npublic:\n    string largestWordCount(vector<string>& messages, vector<string>& senders) {\n        int n = messages.size();\n        unorder
```\nclass Solution {\npublic:\n    string largestWordCount(vector<string>& messages, vector<string>& senders) {\n        int n = messages.size();\n        unordered_map<string,int> mp; // count of words for each sender.\n        \n        int count = 0;\n        for(int i = 0;i<n;i++){\n            count = 0;\n            string s = messages[i];\n            for(int j = 0;j<s.size();j++){\n                if(s[j] == \' \'){\n                    count++;\n                }\n            }\n            count++;\n            mp[senders[i]]+= count;\n        }\n        vector<int> counts; // for all the counts, made extra array for (if in the case) more than one \n        // maximums.\n        for(auto &it : mp){\n            counts.push_back(it.second);\n        }\n        int ctmax = *max_element(counts.begin(),counts.end()); \n        vector<string> ans;\n        for(auto &it : mp){\n            if(it.second == ctmax)\n                ans.push_back(it.first);\n        }\n        // populated ans with all the maximums.\n        if(ans.size() == 1)\n            return ans[0];\n        else{\n            return *max_element(ans.begin(),ans.end());\n        }\n    }\n};\n```
['C']