Time complexity

#1

what is time complexity of the map, when use insert, find, delete

#2

Hi @mkjha,
Average time complexity is O(1)
Worst case is O(n) for insert,find and delete.
Hope dis helps

#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.