getting TLE and a MLE in last case
Mike and HashTrick
Try to solve this in O(n) time complexity. You need to just find the unique elements in the array in sorted manner.
Hey can you provide O(n) based solution for this problem as discussed in problem hint video as i am not able to get it.
I try to write another approach and passes testcases - as we want to print numbers according to their increasing hashmap value i just count them, sort and print.