Average case: for insert, lookup, delete. Worst case: if all keys collide (hash to the same index).
Collisions are rare with good hash functions and proper table sizing. In competitive programming, assume unless you're dealing with adversarial inputs.
Some judges craft test cases to break weak hash functions. If you get TLE, consider using a tree-based map () instead. Time: . Space: .