What methods are used to resolve conflicts when keys collide in a Map data structure?

In the data structure Map (hash table), the following methods are used to resolve conflicts when keys collide (collisions):

• Chaining method: each cell of the hash table contains a list (or another container) of elements with the same hash code. When a collision occurs, the new element is added to this list.

• Open addressing: when a collision occurs, the next free cell is searched according to a certain sequence (linear probing, quadratic probing, double hashing).

In Go, the built-in map implementation uses chaining with optimizations for fast access and memory management, so collisions are handled automatically without developer intervention.