Implement a Hash Table / HashMap
Intermediate
Build a key-value store that resolves collisions via chaining. Implement put(key, value), get(key), remove(key) with average O(1) time. Handle collisions by storing multiple entries in each bucket.
Keywords
dsa
Python
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.