easy c++ solution || using map and stl
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    string largestWordCount(vector<string>& m, vector<string>& s) {\n        unordered_map<string,int> mp;\n        int mx=INT_MIN;\n        string ans="";\n        for(int i=0;i<m.size();i++)\n        {\n            char ch=\' \';\n            int counter=0;\n            counter=count(m[i].begin(),m[i].end(),ch);\n            mp[s[i]]+=(counter+1);\n            if(mp[s[i]] == mx){\n               ans = max(ans ,s[i] );\n            }\n            else if(mp[s[i]] > mx){\n                mx = mp[s[i]];\n                ans = s[i];\n            }\n        }  \n        return ans;\n    }\n};\n```
['C++']