Leetcode 705. Design HashSet

Implement a HashSet from scratch supporting add(key), remove(key), and contains(key) without using built-in hash table libraries. Keys are integers in [0, 10^6] with up to 10^4 operations, so solutions should aim for O(1) average-time operations (e.g., via hashing or direct-indexing).