Hash Table
A data structure that maps keys to values using a hash function, providing average O(1) time complexity for lookups, insertions, and deletions.
Hash Table — A data structure that maps keys to values using a hash function, providing average O(1) time complexity for lookups, insertions, and deletions.
Hash tables compute a hash of the key to determine where to store the value in an array. Collisions (different keys mapping to same index) are handled by chaining (linked lists) or open addressing (probing nearby slots).
Hash tables power dictionaries (Python dict), objects (JavaScript), HashMaps (Java), and associative arrays (PHP). They are the most commonly used data structure for fast key-based lookups. Performance degrades with many collisions or high load factors.
Learn more: Full glossary entry →
Related Resources
