In open addressing, how are collisions typically resolved?

Explanation

Open addressing stores every key directly inside the hash table itself, with no auxiliary structures. When a collision occurs, the algorithm probes the table using a fixed scheme (linear probing, quadratic probing, or double hashing) to find the next free slot and places the key there. Option 2 describes separate chaining, a different collision-resolution family that uses external linked lists, not open addressing. Rehashing the whole table only happens on a load-factor-triggered resize, not on every collision, so the correct description is probing for the next open slot.