Easy c++ solution using unordered set
Intuition\n Describe your first thoughts on how to solve this problem. \nreverse  and check the string is  present in the set\n\n# Approach\n Describe your appr
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nreverse  and check the string is  present in the set\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)$$ -->\nO(n)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(n)\n\n# Code\n```\nclass Solution {\npublic:\n    int maximumNumberOfStringPairs(vector<string>& words) {\n        unordered_set<string>mp;\n        int res=0;\n        for(auto it:words){\n            string s=it;\n            reverse(it.begin(),it.end());\n            if(mp.find(it)==mp.end()){\n                mp.insert(s);\n            }\n            else res++;\n           \n        }\n        return res;\n    }\n};\n```
['C++']