🎁 New User? Get 20% off your first purchase with code NEWUSER20 · ⚡ Instant download · 🔒 Secure checkout Register Now →
Menu

Categories

Programming Concepts Intermediate

What is 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.

Related Terms

Queue
A data structure that follows First-In-First-Out (FIFO) ordering, where elements are added at the rear and removed from the front.
Binary Search
An efficient search algorithm that finds a target value in a sorted array by repeatedly dividing the search interval in half.
Memoization
An optimization technique that caches function results for given inputs, avoiding redundant computations for repeated calls.
Version Control
A system that records changes to files over time, allowing you to recall specific versions, collaborate, and track history.
Functional Programming
A programming paradigm that treats computation as the evaluation of mathematical functions, avoiding state changes and mutable data.
Regex (Regular Expression)
A sequence of characters that defines a search pattern, used for string matching, validation, and text manipulation.
 View All Programming Concepts Terms →