C++| EASY TO UNDERSTAND | fast and efficient using HASHTABLES
Please upvote to motivate me in my quest of documenting all leetcode solutions. HAPPY CODING:)\nAny suggestions and improvements are always welcome\n```\nclass 
***Please upvote to motivate me in my quest of documenting all leetcode solutions. HAPPY CODING:)\nAny suggestions and improvements are always welcome***\n```\nclass Solution {\npublic:\n    bool makeEqual(vector<string>& words) {\n        unordered_map<char,int> mp;\n        for(int i=0;i<words.size();i++)\n        {\n            for(char c:words[i])\n            {\n                mp[c]++;\n            }\n        }\n        for(auto pr:mp)\n        {\n            if(pr.second%words.size()!=0)\n              return false;  \n        }\n        return true;\n    }\n};
['Hash Table', 'C']