C++ || HashSet
\nclass Solution {\npublic:\n  int maximumNumberOfStringPairs(vector<string>& words) {\n    unordered_set<string> hash_set;\n    \n    int ans = 0;\n    for (au
```\nclass Solution {\npublic:\n  int maximumNumberOfStringPairs(vector<string>& words) {\n    unordered_set<string> hash_set;\n    \n    int ans = 0;\n    for (auto& word: words) {\n      sort(begin(word), end(word));\n      if (hash_set.find(word) != end(hash_set) ) {\n        hash_set.erase(word);\n        ans++;\n      } else {\n        hash_set.insert(word);\n      }\n    }\n    \n    return ans;\n  }\n};\n```
[]