EASY SET SOLUTION
Intuition\nSet stores all unique occurences\n\n\n\n# Code\n\nclass Solution {\npublic:\n    int similarPairs(vector<string>& words) {\n        int count =0;\n  
# Intuition\nSet stores all unique occurences\n\n\n\n# Code\n```\nclass Solution {\npublic:\n    int similarPairs(vector<string>& words) {\n        int count =0;\n        for(int i=0;i<words.size();i++){\n            unordered_set<char> st;\n            for(auto w:words[i]){\n                st.insert(w);\n            }   \n            for(int j=i+1;j<words.size();j++){\n                bool flag = true;\n                unordered_set<int> temp;\n                for(auto w:words[j]){\n                    temp.insert(w);\n                    if(st.find(w) == st.end()){\n                        flag = false;\n                        break;\n                    }\n                }\n                if(flag && temp.size() == st.size()) {\n                    cout<<words[i]<<"-->"<<words[j]<<endl;\n                    count++;\n                }\n            }  \n        }\n        return count;\n    }\n};\n```
['C++']