Easy CPP intuitive approach☑️☑️
If helpful pls upvote me \uD83E\uDD79\n\n# Code\n\nclass Solution {\npublic:\n    int similarPairs(vector<string>& words) {\n        int count = 0;\n        \n 
# **If helpful pls upvote me \uD83E\uDD79**\n\n# Code\n```\nclass Solution {\npublic:\n    int similarPairs(vector<string>& words) {\n        int count = 0;\n        \n        for(int i = 0; i<words.size(); i++){\n            unordered_set<char>myset;\n            string temp = words[i];\n            for(auto &t: temp){\n                myset.insert(t);\n            }\n            \n            for(int j = i+1; j<words.size(); j++){\n                unordered_set<char>set2;\n                string s = words[j];\n                for(auto &t: s){\n                    set2.insert(t);\n                }\n                if(myset.size() == set2.size() && myset == set2){\n                    count += 1;\n                }\n            }\n        }\n        \n        return count;   \n    }\n};\n```
['C++']