A collection that contains no duplicate elements, backed by a hash table. Choose an algorithm below to launch its interactive simulation workstation.
Showing 5 of 5 algorithms
Remove a key while preserving probing/search behavior.
Add a unique key to the hash set.
Check whether a key exists in the hash set.
Keep only values that appear in both sets.
Combine all unique values from two sets.