collision

RU: коллизия

A hash collision occurs when two distinct keys produce the same hash value and therefore map to the same bucket in a hash table. Collisions are inevitable by the pigeonhole principle; hash tables resolve them via chaining (linked list per bucket) or open addressing (probing for a free slot). Many collisions degrade average-case O(1) operations toward O(n).