What methods can be used to prevent or resolve collisions when using the Map data structure?

In a data structure like Map (for example, a hash table), a collision occurs when two different keys have the same hash and fall into the same cell.

Ways to prevent or resolve collisions:

1. Chaining method — each cell stores a list (or another container) of all elements with the same hash. When a collision occurs, the new element is added to this list.

2. Open addressing — upon collision, the next free cell is searched according to a specific rule (linear probing, quadratic probing, double hashing).

3. Improving the hash function — using a high-quality hash function that distributes keys evenly across the table, reducing the likelihood of collisions.

4. Rehashing — when a certain load factor is reached, the table size is increased and all elements are redistributed.

In Go, the built-in map implementation uses chaining with dynamic resizing, which allows efficient handling of collisions without additional intervention.