Random Probing

Random Probing is a Hash Table collision resolution method. When a collision occurs, the element is placed in a randomly chosen slot instead of the next one.

In practice, the "random" sequence of slots is pseudo-random and determined by the key, so a lookup can follow the same sequence to find the element again.

Compare with Linear Probing, which just checks the next slot, and Separate Chaining.