Hash Table

A hash table stores key–value pairs and provides fast lookup using a hash function. It offers average constant-time access. Collisions must be handled. Example: A dictionary mapping usernames to IDs.

Go Back