Hash Idioms

Finding unique values with undef

Each key exists only once in a hash, so assigning multiple values to the same key stores only the most recent value. This behavior has advantages! For example, we can find unique elements of a list: