Algorithms for Beginners / Chapter 4 — Data structures (lessons 10–14) / Lesson 12

Hash tables (1,000x by turning an in into a set)

🔒

Create a free account to read this lesson

Sign up for a free membership to read every lesson in our free courses. Already have an account? Please sign in.

Sign up free Sign in

‹ Previous: Linked lists (the exact opposite properties to an array) Next: Trees and binary search trees (the shape depends on the insertion order) ›