Two tables, two hash functions, and every key in one of its two nests. An insert kicks the old key out to its other nest, and so on; a lookup never needs more than two probes.
This interactive visualization needs JavaScript.