The_gap

The Gap is something that exists between what you learn in your DS and Algos course, and how you actually implement it in Python/Leetcode.

Graphs are a big one.

But even bigger are hashmaps.

In general, when we have $h(k_1) = h(k_2)$ we cannot conclude $k_1 = k_2$. But in Python we can (kind of).