Pick one and press Start, then click Next › to step through it.
Watch for
Every entry jumping to a new slot as the array doubles — most move, because the bucket depends on a capacity that just changed.
More about this scenario
You'll learn
Why a hash table can't just keep filling: past about 0.75 full, probe chains grow long, so it grows and re-places every key to keep lookups fast.
How it runs
Two PUTs push the load factor over the 0.7 threshold. The table allocates 16 slots and reinserts all six entries, recomputing each bucket as hash modulo 16.