Mike and Hash trick

#1

Please tell me how to approach this problem.

#2

actually , you have to mark all the distinct elements and them print them by their new-marked-index orderwise.

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

#4


check out the link…it can easily be solved using 2 maps…In O(n)…
If use sorting then it will take O(nlog(n))…