What causes collisions when using a hash table in HashMap?

Collisions in HashMap occur when two different keys have the same hash value, meaning they fall into the same bucket. This requires the HashMap to resolve conflicts, usually through chaining (linked lists) or other methods, to store multiple elements in one bucket. The more collisions there are, the worse the performance of search and insert operations.