🔥MAP🔥||🔥C++🔥||🔥MOST SIMPLE🔥||🔥EASY TO UNDERSTAND🔥
if this code helps you, please upvote\n# Code\n\nclass Solution {\npublic:\n    int maximumNumberOfStringPairs(vector<string>& words) {\n        int ans = 0;\n 
# if this code helps you, please upvote\n# Code\n```\nclass Solution {\npublic:\n    int maximumNumberOfStringPairs(vector<string>& words) {\n        int ans = 0;\n        unordered_map<string,int> mp;\n        string s;\n        for(auto &i: words){\n            s = i;\n            reverse(s.begin(),s.end());\n            if(mp.count(s)){\n                ans++;\n                mp.erase(i);\n            }else{\n                mp[i]++;\n            }\n        }\n        return ans;\n    }\n};\n```
['Hash Table', 'String', 'String Matching', 'C++']