Hash maps, from scratch

Why lookup is O(1), and what happens when it isn't.

Prompt

Make a one-page reference card for hash maps in Python. Explain why lookup is O(1) on average, list the operations with their costs, and show a worked example with insert, lookup, and delete.