🔥🔥 SIMPLE C++ SOLTION 🔥WITHOUT MAP🔥🔥
\'\'\'\nclass Solution {\npublic:\n\n    int maximumNumberOfStringPairs(vector& words) {\n        int n=words.size();\n        int cnt=0;\n        \n        for
\'\'\'\nclass Solution {\npublic:\n\n    int maximumNumberOfStringPairs(vector<string>& words) {\n        int n=words.size();\n        int cnt=0;\n        \n        for(int i=0; i<n-1; i++){\n            string s=words[i];\n            for(int j=i+1; j<n; j++){\n                string t=words[j];\n                reverse(t.begin(), t.end());\n                if(t==s && s[0]!=s[1]) cnt++;\n                \n            }\n        }\n        \n        return cnt;\n    }\n};\n\n\'\'\'\n\n-----------------UPVOTE--------------------
[]