Easy and Understandable Code || Accepted✅✅
Intuition\n Describe your first thoughts on how to solve this problem. \nReverse can help\n\n# Approach\n Describe your approach to solving the problem. \n1. It
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nReverse can help\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n1. Iterate the loop\n2. each and every word reverse\n3. and check weather they are equal or not\n4. print result \n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n$$O(n2)$$\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n$$O(1)$$\n\n# Code\n```\nclass Solution {\npublic:\n    int maximumNumberOfStringPairs(vector<string>& words) {\n        int n = words.size();\n        int ans = 0;\n        for(int i=0;i<n;i++){\n            for(int j = i+ 1;j<n;j++){\n                string s1 = words[i];\n                string s2 = words[j];\n                reverse(s2.begin(), s2.end());\n                // cout<<s1<<" "<<s2<<endl;\n                if(s1 == s2){\n                    ans++;\n                    // cout<<ans;\n                }\n            \n            }\n        }\n        return ans;\n        \n    }\n};\n```
['C++']