8 hash map problems, solved step by step.

Problems where remembering what you have already seen turns a nested loop into one pass: a map from value to index, a count per key, or a set of seen items. Each one is solved in 22 languages from brute force to optimal, with code you can run on the page.