Unordered map and set

#1

what is the time complexity of finding elements in maps and set, and its other functions too

#2

@sktg99
For both unordered_map and unordered_set , the time complexities for all three operations - Insertion , deletion and searching are O(1).

#3

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.