✅ C++ || intuitive easy solution || count equal set
\n# Code\n\nclass Solution {\npublic:\n    int similarPairs(vector<string>& w) {\n        int cnt=0;\n        vector<set<char>> v;\n        for(int i=0;i<w.size
\n# Code\n```\nclass Solution {\npublic:\n    int similarPairs(vector<string>& w) {\n        int cnt=0;\n        vector<set<char>> v;\n        for(int i=0;i<w.size();i++){\n            set<char> st(w[i].begin(),w[i].end());\n            v.push_back(st);\n        }\n        for(int i=0;i<w.size()-1;i++){\n            for(int j=i+1;j<w.size();j++){\n                if(v[i]==v[j]){\n                    cnt++;\n                }\n            }\n        }\n        return cnt;\n    }\n};\n```\n
['Ordered Set', 'C++']