c++ beginer friendly||clean ||simple||easy to understand
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nfirst find the similar 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nfirst find the similar strings by using mao if characters then using that create a vector of string and then using another map count the number of stirng which are equal and then using logic to count the different pairs return the ans.\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        // m<char,int>m;\n        vector<string> v;\n        for(int i=0;i<words.size();++i)\n        {\n            map<char,int>m;\n            int l=words[i].size();\n            for(int j=0;j<l;++j)\n            \n            {\n                m[words[i][j]]++;\n            }\n            string s="";\n            for(auto it:m)\n            {\n                \n                if(it.second>0)\n                {\n                    s=s+it.first;\n                }\n            }\n         v.push_back(s);\n        }\n        map<string ,int>mm;\n        for(int i=0;i<v.size();++i)\n        {\n            mm[v[i]]++;\n        }\n        int ans=0;\n        for(auto it:mm)\n            \n        {\n             if(it.second>1)\n             {\n                int p=(pow(it.second,2))-it.second;\n                 ans+=ceil(p/2);\n             }\n        }\n        \n       return ans ;\n    }\n};\n```
['C++']