Hash TablesLesson 22Free preview

DSA Hash Maps

This lesson is part of DSA · All levels

Summary

A hash map is a key-value structure that stores data pairs using a hash function, also known as a dictionary. It allows key-based value searching in average time. This principle is the same as a hash table, only the terms differ between programming languages.

Key points

Keeping key-value pairs
Lookup, insert, and delete average
The key must be unique, the value must be duplicate
Known by different names: map, dictionary, hashtable

Full lesson

Code examples and quizzes

Full lessons, code examples, and quizzes are available to subscribers. 5 questions.