Very easy C++ Code(100%)
Code\n\nSimple using set\n\nclass Solution {\npublic:\n    int similarPairs(vector<string>& w){\n        int n = w.size();\n        int count = 0;\n        for(
# Code\n\nSimple using set\n```\nclass Solution {\npublic:\n    int similarPairs(vector<string>& w){\n        int n = w.size();\n        int count = 0;\n        for(int i=0;i<n;i++){\n            set<char> s(w[i].begin(),w[i].end());\n            string s1(s.begin(),s.end());\n            w[i] = s1;\n        }\n        for(int i =0;i<n-1;i++)\n            for(int j = i+1; j<n; j++)\n                if(w[i]==w[j])\n                    count++;\n        return count;\n    }\n};\n```\nor using map\n```\nclass Solution {\npublic:\n    int similarPairs(vector<string>& w){\n        int n = w.size();\n        int count = 0;\n        for(int i=0;i<n;i++){\n            set<char> s(w[i].begin(),w[i].end());\n            string s1(s.begin(),s.end());\n            w[i] = s1;\n        }\n        map<string,int> m;\n        for(int i=0; i<n; i++)\n            m[w[i]]++;\n        for(auto i:m)\n            count += ((i.second)*(i.second-1))/2;\n        return count;\n    }\n};\n```
['C++']