The Algorithms and Data Structures Series: Hash Tables

Hash tables are one of the most important data structures in computer science, powering everything from databases to search engines. In this 90-minute class, we’ll explore how hash tables work and why they’re the go-to solution for storing and retrieving data efficiently.

We’ll break down the core concepts step by step: how keys are mapped to values, how hashing functions organize data, and how to deal with collisions when multiple keys land in the same spot. Using clear examples in Python, you’ll see how to implement your own hash table and practice with real scenarios like building dictionaries, caches, and frequency counters.

By the end of the session, you’ll have a solid grasp of how hash tables are used in algorithms and applications every day. This class is ideal for beginners with some Python basics who want to strengthen their foundations in data structures and take their problem-solving skills to the next level.

The class will take place here - https://www.passion-class.com/en/join-sample-passionclass

If you want to join the full class, you can do so here: https://www.passion-class.com/en/classes/Thinking-and-Change/Programming