LECTURE 10 OF 25
Hash Tables and Sets
Progress from remembering whether a key exists to storing counts, complements, canonical signatures, and one-to-one mappings.
Builds on
Best read after 1. Big-O Notation, 2. Arrays, 3. Strings — you can still read ahead, but some of this may lean on ideas covered there.