@atul approach sounds good but we have to check for each time counts updated isn't it , though even can sort the hash table & return top k number . also as i know we have splay tree , even google uses it , to get most frequent item .
Thanks Shashank. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/gucYTW56cCsJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
