Explain internal working of Hash Table?

Question

Accepted Answer

Hash table is a data structure that stores key-value pairs and uses a hash function to map keys to their corresponding values.

Hash table consists of an array of buckets, each containing a linked list of key-value pairs.
When inserting a key-value pair, the hash function is used to determine the index of the bucket where the pair should be stored.
During retrieval, the hash function is used again to find the correct bucket and then search the linked list for the key.
Hash collisions can occur when two keys map to the same bucket, which can be resolved using techniques like chaining or open addressing.
Example: If we have a hash table with 10 buckets and want to store the key 'apple' with value 'red', the hash function might map 'apple' to bucket 3 where it is stored as a key-value pair.

Popular interview questions of Principal Engineer