EASY C++ SOLUTION || 100% BEATS || 0 ms
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- O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n- O(N)\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        unordered_set<string> set;\n        int count = 0;\n        for(int i =0;i<words.size();i++){\n            string str = words[i];\n            string rev = str;\n            reverse(rev.begin(),rev.end());\n            if(set.contains(rev)){\n                count++;\n                set.erase(rev);\n            }\n            else set.insert(str);\n        }\n        return count;\n    }\n};\n```
['Array', 'Hash Table', 'C++']