Hash maps

Definition

Hash maps are data structures that store key-value pairs, where each key is unique. They use a hash function to convert the key into an index in an array, allowing for efficient retrieval and insertion of values.

Related terms

Arrays:

Data structures that store elements in contiguous memory locations.

Hash functions: Algorithms that take an input and produce a fixed-size output (hash value).

Collision resolution: Techniques used when two keys produce the same hash value in a hash map.