c++ easy solutions
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        int n=words.size();\n        int count=0;\n       \n        vector<string>save;\n        \n        for(int i=0;i<n;i++)\n        {\n              set<char>s;\n            for(auto x:words[i])\n            {\n                s.insert(x);\n            }\n            \n            string str="";\n            for(auto y:s)\n            {\n                str+=y;\n            }\n            \n            save.push_back(str);\n        }\n        \n        for(int i=0;i<n;i++)\n        {\n            for(int j=i+1;j<n;j++)\n            {\n                if(save[i]==save[j]){\n                    count++;\n                }\n            }\n        }\n        return count;\n    }\n};\n```
['C++']