HOW rehashing takes o(1) time in stl part in hashing concept of unordered map

#1

HOW rehashing takes o(1) time in stl part in hashing concept of unordered map

#2

@AMIT_KUMAR
Rehashing takes O(n) in total
For each n elements it is O(1)

#3

Rehashing takes O(n) in total
For each n elements it is O(1)

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.