C++ 2 Simple And Efficient Solution
If you find it helpful then please upvote\n\n\n bool makeEqual(vector<string>& words) {\n        \n        //using hasmaps (55% efficient)\n//         unordered
**If you find it helpful then please upvote**\n\n```\n bool makeEqual(vector<string>& words) {\n        \n        //using hasmaps (55% efficient)\n//         unordered_map<char,int> m;\n//         int n = words.size();\n//         for(int i=0;i<n;i++){\n//             for(int j=0; j<words[i].size();j++){\n//                 m[words[i][j]]++;\n//             }\n//         }\n        \n//         unordered_map<char,int>::iterator itr;\n//         for(itr = m.begin(); itr!=m.end();itr++){\n//             if(((itr->second)%n)!=0){\n//                 return false;\n//             }\n//         }\n//         return true;\n        \n        //using vector(95% efficient)\n        vector<int> v(26,0);\n        for(auto w:words){\n            for(auto ch:w){\n                v[ch-\'a\']++;\n            }\n        }\n        int n = words.size();\n        for(auto itr=v.begin(); itr!=v.end(); itr++){\n            if(*itr%n!=0){\n                return false;\n            }\n        }\n        return true;\n    }\n\t```
[]