Interview Question
Country: United States
HashTable is implemented with the hashing function, which generates the hashing value based on the key as the input, and the hash table, which stores these hashing values. Array is the basic data structure that is required to provide the function as a hash table that contains the hash values. However, to resolve the collision, a technique called separate chaining is typically used, and the linked list is commonly used during the implementation process.
Hash table is generally implemented using array (used as buckets) and linked list (to store actual key and value pairs)
- Rohit December 29, 2013