C++ || EASY TO UNDERSTAND || Simple Approach
\nclass Solution {\npublic:\n    string largestWordCount(vector<string>& m, vector<string>& s) {\n        int n=m.size();\n        map<string,vector<string>> mp
```\nclass Solution {\npublic:\n    string largestWordCount(vector<string>& m, vector<string>& s) {\n        int n=m.size();\n        map<string,vector<string>> mp;\n        int maxi=-1;\n        string ans="asdja";\n        for(int i=0;i<n;i++)\n        {\n            string str=m[i]+\' \';\n            int left=0;\n            for(int j=0;j<str.size();j++)\n            {\n                if(str[j]==\' \')\n                {\n                    string str2=str.substr(left,j-left);\n     \n                    left=j+1;\n                    mp[s[i]].push_back(str2);\n                    maxi=max((int)maxi,(int)mp[s[i]].size());\n                }\n            }\n        }\n        for(auto pr:mp)\n        {\n            if(pr.second.size()==maxi)\n            {\n                ans=pr.first;\n            }\n        }\n        return ans;\n    }\n};\n```\n**Please upvote to motivate me in my quest of documenting all leetcode solutions(to help the community). HAPPY CODING:)\nAny suggestions and improvements are always welcome**
[]