##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Identical hash values)
A hash function maps strings to integers from 0 to 99 (100 possible values). You hash 101 strings. At least two strings have the same hash.
Why? 101 strings, 100 hash values. Pigeonhole principle. This is why hash collisions are inevitable.
The principle doesn't tell you which strings collide, but guarantees at least one collision.
