Highest frequency( Hashing ) Java

#1

I cant traverse through the Hashmap that has been given in the question. Is there a way to solve this question without using the default java Hashmap?

#2

Hi @justformyntra8
as it is asked that the code should function in o(n) time complexity so the best approach to solve this question is by using hashmaps only.

#3

Hi @justformyntra8 as you are not responding to the thread, I am marking your doubt as resolved for now. Re-open it if required.

Please mark your doubts as resolved in your course’s “Ask Doubt” section, when your doubt is resolved.

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