Simple c++ solution using hash map
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int similarPairs(vector<string>& words) {\n    \n     map<string,int>mp;\n     for(auto it:words){\n          set<char>st;\n         for(auto at:it){\n             st.insert(at);\n         }\n         string s;\n         for(auto sr:st){\n             s+=sr;\n         }\n         sort(s.begin(),s.end());\n         mp[s]++;\n     }\n     int c=0;\n     for(auto it :mp ){\n          int x=it.second;\n          if(x>1){\n               c+=(x*(x-1))/2;\n          }\n         \n     }   \n     return c;\n    }\n};\n```
['Hash Table', 'C++']