Hash maps and counting

Dicts and sets look up in roughly constant time, which turns many quadratic solutions into linear ones. The trick is usually 'what have I already seen?'.

collections.Counter counts anything iterable and ranks it, replacing a manual loop.

defaultdict groups items without writing the 'if key not in dict' dance.