C++ || 100% Testcase Passed ✅
Complexity\n- Time complexity: O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(n)\n Add your space complexity here, e.g. O(n) \n\n# Co
# Complexity\n- Time complexity: O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int similarPairs(vector<string>& words) {\n        for(int i=0; i<words.size(); i++){\n            map<char, bool> mp;\n            \n            // push it to the map and remove duplicates character\n            for(auto j: words[i]) mp[j] = 1;\n            string temp;\n\n            // covert the map into string\n            for(auto j: mp) temp.push_back(j.first);\n            \n            words[i] = temp;\n        }\n\n        // count the repeated string in the array\n        map<string, int> mp;\n        for(auto i: words) mp[i]++;\n        \n        // calclute the possible combination\n        int count = 0;\n        for(auto i: mp){\n            int x=(i.second-1)*(i.second)/2;\n            count+=x;\n        }\n\n        // returning the count\n        return count;\n        \n\n    }\n};\n```
['Hash Table', 'String', 'Ordered Map', 'C++']