[ Python ] ✅✅ Simple Python Solution Using HashMap | 95 % Faster🥳✌👍
If You like the Solution, Don\'t Forget To UpVote Me, Please UpVote! \uD83D\uDD3C\uD83D\uDE4F\n# Runtime: 52 ms, faster than 95.84% of Python3 online submission
# If You like the Solution, Don\'t Forget To UpVote Me, Please UpVote! \uD83D\uDD3C\uD83D\uDE4F\n# Runtime: 52 ms, faster than 95.84% of Python3 online submissions for Find Maximum Number of String Pairs.\n# Memory Usage: 16.3 MB, less than 77.61% of Python3 online submissions for Find Maximum Number of String Pairs.\n\n![image](https://assets.leetcode.com/users/images/a34a2061-717a-4bd4-968e-4184005e17bf_1687949173.33394.png)\n\n\tclass Solution:\n\t\tdef maximumNumberOfStringPairs(self, words: List[str]) -> int:\n\n\t\t\tresult = 0\n\t\t\thash_map = {}\n\n\t\t\tfor word in words:\n\n\t\t\t\treverse_word = word[::-1]\n\n\t\t\t\tif reverse_word in hash_map:\n\t\t\t\t\thash_map[reverse_word] = hash_map[reverse_word] + 1\n\n\t\t\t\telif word not in hash_map:\n\t\t\t\t\thash_map[word] = 1\n\n\t\t\tfor key in hash_map:\n\n\t\t\t\tif hash_map[key] > 1:\n\t\t\t\t\tresult = result + 1\n\n\t\t\treturn result\n\t\t\t\n# Thank You \uD83E\uDD73\u270C\uD83D\uDC4D
['Hash Table', 'String', 'Python', 'Python3']