medium10 pts · first answer countshash-mapdesigninternals
Designing a basic hash set
You implement a hash set of integers using key % B to choose among B buckets, each a small list. Why do textbooks often choose B as a prime number?
Discussion 0
Join free to post in the discussion.
Related questions
- Average cost of a hash map lookupBackend Developer
- Worst case for a hash map lookupBackend Developer
- Removing duplicates with a SetBackend Developer
- Number keys in a plain objectBackend Developer
- Iteration order of a MapBackend Developer
- When to choose Map over a plain objectBackend Developer
- Set of look-alike objectsBackend Developer
- Counting letters in a wordBackend Developer