Answer:
A hash table is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a hash function to compute an index into an array of buckets or slots, from which the correct value can be found.
| Previous Question | Next Question |
| Explain about binary search? | What is central limit theorem? |