# Hash Crash Revolutions

Suppose our hash table has $$10^3$$ slots. Under the simple uniform hashing assumption, what is the expected number of distinct elements that needs to be inserted into the table so that all of the slots are occupied by at least one element?

This problem is a part of the Hash Crash Series

×