Hash Maps
Key → value storage with average $O(1)$ lookup using a hash function.
Easy
Collisions are handled by chaining or open addressing; keep the load factor low by resizing.
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.