Python, Use List as Hashbucket, Faster than 90%
\nNUM_BUCKETS = 2003 # A prime number\n\nclass MyHashSet:\n\n    def __init__(self):\n        # Make the hash buckets.\n        self.buckets = [[] for _ in rang
```\nNUM_BUCKETS = 2003 # A prime number\n\nclass MyHashSet:\n\n    def __init__(self):\n        # Make the hash buckets.\n        self.buckets = [[] for _ in range(NUM_BUCKETS)]\n\n    def add(self, key: int) -> None:\n        mod = key % NUM_BUCKETS\n        if not key in self.buckets[mod]:\n            self.buckets[mod].append(key)\n\n    def remove(self, key: int) -> None:\n        mod = key % NUM_BUCKETS\n        # Remove if it\'s present\n        try:\n            self.buckets[mod].remove(key)\n        except:\n            pass\n           \n    def contains(self, key: int) -> bool:\n        mod = key % NUM_BUCKETS\n        return key in self.buckets[mod]\n\n```
['Python']