Just Count
As characters can be moved to any position, we just need to check if the count of any character is divisible by given words length or not.\n```\nclass Solution 
As characters can be moved to any position, we just need to check if the count of any character is divisible by given words length or not.\n```\nclass Solution {\npublic:\n    bool makeEqual(vector<string>& words) {\n        int mp[26] = {0};\n        for(auto &word: words){\n            for(auto &c: word){\n                mp[c - \'a\']++;\n            }\n        }\n        \n        for(int i = 0;i<26;i++){\n            if(mp[i] % words.size() != 0) return false;\n        }\n        return true;      \n    }\n};
['C']