Hash TablesLesson 21Free preview

DSA Hash Sets

This lesson is part of DSA · All levels

Summary

A hash set is a unique set of values stored using hashing, so that search, insertion, and deletion takes place on average. This structure is very useful for removing duplicates and checking memberships quickly. Because it only holds keys without value, it's unbalanced and has no index.

Key points

Keeping unique value without key-value pairs
Add, remove, and contain operations cost an average of O(1)
Suitable for deleting duplicates and membership checks
The order of elements is uncertain.

Full lesson

Code examples and quizzes

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