c++ || self expalantory
\nclass Solution {\npublic:\n    bool makeEqual(vector<string>& words) {\n        int cnt[26] = {0};\n        //count the freq of each char\n        for (auto &
```\nclass Solution {\npublic:\n    bool makeEqual(vector<string>& words) {\n        int cnt[26] = {0};\n        //count the freq of each char\n        for (auto &w : words)\n           for (auto ch : w)\n               ++cnt[ch - \'a\'];\n        \n        \n        int n=words.size();\n        for(int i: cnt)\n            // check if we can distribute the freq in all the words equally or not, if no then return false.\n            if(i%n!=0) return false;\n        return true;\n    }\n};\n```\n**Feel free to ask any question in the comment section.**\nI hope that you\'ve found the solution useful.\nIn that case, **please do upvote and encourage me** to on my quest to document all leetcode problems\uD83D\uDE03\nHappy Coding :)\n
['C', 'C++']