C++ Simple and Easy Solution || hashing
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:O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    bool makeEqual(vector<string>& words) {\n        int hash[26]={0};\n        for(int i=0;i<words.size();i++){\n            for(int j=0;j<words[i].size();j++){\n                hash[words[i][j]-\'a\']++;\n            }\n        }\n        for(int i=0;i<26;i++){\n            if(hash[i]%words.size()!=0) return false;\n        }\n        return true;\n    }\n};\n```
['C++']