C++ || HAshing || Easy Solution
\n\n# Code\n\nclass Solution {\npublic:\n    int similarPairs(vector<string>& words) {\n        map<set<int> , int> mp;\n        for(auto s:words){\n           
\n\n# Code\n```\nclass Solution {\npublic:\n    int similarPairs(vector<string>& words) {\n        map<set<int> , int> mp;\n        for(auto s:words){\n            set<int> st;\n            for(char c:s){\n                st.insert(c);// it finds all the unique character in a string store it to set\n            }\n            \n            mp[st]++;//above set is maped here \n                     // i.e. counting number of string contain these unique characters \n        }\n        int res=0;\n        for(auto p:mp){\n            if(p.second>1){\n                int n=p.second;\n                res = res + (n*(n-1))/2; // here just counting number of pair possible (it\'s simple mathematics)\n            }\n        }\n        return res;\n    }\n};\n```
['C++']