VQn6vf - Online Python3 Interpreter & Debugging Tool

class MyHashSet:

    def __init__(self):
        self._length = 10000
        self.arr = [None] * self._length

    def add(self, key: int) -> None:
        i = self.hashify(key)
        while self.arr[i % self._length] is not None:
            if self.arr[i % self._length] == key:
                return
            i += 1
        self.arr[i] = key

    def remove(self, key: int) -> None:
        i = self.hashify(key)
        while self.arr[i % self._length] is not None and self.arr[i % self._length] != key:
            i += 1
        self.arr[i] = None


    def contains(self, key: int) -> bool:
        i = self.hashify(key)
        while self.arr[i % self._length] is not None:
            if self.arr[i % self._length] == key:
                return True
            i += 1
        return False
    def hashify(self, key: int) -> int:
        return key % self._length


# Your MyHashSet object will be instantiated and called as such:
# obj = MyHashSet()
# obj.add(key)
# obj.remove(key)
# param_3 = obj.contains(key)