What is the time complexity of searching for an element in a HashMap by key?

In HashMap, searching for an element by key is on average performed in O(1) time, which is constant time. This is achieved through key hashing and quick access to the corresponding bucket. However, in the worst case, with a large number of collisions, the complexity can degrade to O(n), where n is the number of elements in the bucket.