Click here to see the full article post
@yangshun I have fixed it. Thanks.
Here we can also optimize the given solution by making a min-priority queue or set of size 3. So that we need not to sort the whole 100 values.
As we need only top 3 most frequent elements. So using a min-priority queue of size 3 is sufficient to do so.
@nimxor Thanks for your suggestion. I will try to add this approach soon.
Well, I didn't try but I don't think solution 2 can survive all possible test cases. When all input starts with 'a', doesn't it regress to kinda brute-force?
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.