Easy C++ solution
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        vector<string> v;\n        int ans = 0;\n        for(int i =0 ; i<words.size() ; i++){\n            string tmp = words[i];\n            set<char> st;\n            for(int j=0 ; j<tmp.size() ; j++){\n                st.insert(tmp[j]);\n            }\n            string rec;\n            for(auto it=st.begin() ; it!=st.end() ; it++){\n                rec.push_back(*it);\n            }\n            v.push_back(rec);\n        }\n        for(int i=0 ; i<v.size()-1 ; i++){\n            for(int j=i+1 ; j<v.size() ; j++){\n                if(v[i]==v[j]) ans++;\n            }  \n        }\n        return ans;\n        \n    }\n};\n```
['C++']