Highest frequency hashing

#1

i am getting tle in 2 cases tell me whyy my complexicity is o[n]

#2

Hey @lovish2552
Use unordered_map their complexity is O(1)
Map is close to O(logn)

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