What is the chaining method for resolving collisions in a hash table?

Chaining method for resolving collisions in a hash table involves storing a linked list (or another data structure) in each array cell (bucket), where all elements that hash to this cell due to a collision are stored. Instead of overwriting the value during a collision, the new element is added to the linked list of the corresponding bucket.

Example: if two keys have the same hash, they are both placed in the list at that index. During search or deletion, this list is traversed.

This is a simple and effective way to resolve collisions, allowing an arbitrary number of elements to be stored in one bucket without needing to increase the size of the array immediately.