Beats 100%
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 maximumNumberOfStringPairs(vector<string>& words) {\n        int ans=0;\n        for(int i=0; i<words.size(); i++){\n            for(int j=i+1; j<words.size(); j++){\n                reverse(words[j].begin(), words[j].end());\n                if(words[i]==words[j]) ans++;\n            }\n        }\n        return ans;\n    }\n};\n```
['C++']