Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 705. Design HashSet
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source