Overview

The Hash Tables lesson has two related lessons. The first lesson introduces the concept of hash tables through an analogy, in an easy-to-understand way, while the second lesson gets into more of the technical, nitty-gritty parts of hash tables.

Prerequisites

• Big O Notation
• Linked Lists

Learning Objectives

By the end of this module, learners will be able to:

• Define hash functions and hash tables.
• Articulate the benefits of hash tables, in particular as they relate to speed of data access.
• Define collisions and how to resolve them.
• Define hash tables, hash functions, and collisions.
• Explain when you would use open addressing or closed addressing to resolve collisions.
• Identify the implementations of hash tables in programming.

Content

There are three components to this module:

1. Lesson: Introduction to Hash Tables
2. Lesson: Hash Tables Deep Dive
3. Exercise: Implementing a Hash Table

Solution Code

• Exercise Solution: Implementing a Hash Table

Time to Complete

2 hours total:

• 1 hour - Introduction to Hash Tables and Hash Tables Deep Dive Lessons
• 1 hour - Implementing a Hash Table Exercise

Additional Resources

• Handy visualizations for a closed addressing hash table and an open addressing hash table.
• Twenty fun interview questions, all related to various hashing techniques.

Internal resources

✏️ Instructor Guide

🏗️ Release Notes

---

Find a 👾 bug 👾 or have suggestions? Let us know!