Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

HashSet

A collection of unique values with fast membership tests.

HashSet stores each distinct value once (a HashMap with no values); contains, insert, and remove take constant time on average.

Loading interactive…

Examples

  • visited.insert("Rome") returns true the first time and false the second, since the set keeps each value once.

See also

HashMap BTreeSet hash function
Read the full section →