Easy code
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```cpp []\nclass Solution {\npublic:\n    int maximumNumberOfStringPairs(vector<string>& words) {\n        int n = words.size();\n        int count = 0;\n        unordered_set<string>s;\n        for(int i=0; i<n; i++){\n            string rev = words[i];\n            reverse(rev.begin(),rev.end());\n            if(s.find(rev) != s.end()) count++;\n            else s.insert(words[i]);\n        }\n        return count;\n    }\n};\n```
['C++']