maintain a hash of <freq,linked_list> linked_list consists of values of that frequency. values with same frequency comes under same list if pop of a particular value is done, then frequency is changed of that number, a new record would be created if required. maintain two values tracking max and second_max, which would track of highest frequency value. let me know ur suggestions
surender On Wed, Sep 7, 2011 at 1:03 PM, kARTHIK R <[email protected]> wrote: > The frequency is also stored in the heap right? So to do heapify based on > frequency, first you have to spot the element on the heap. That itself will > take O(n). [ Heapfying after that takes only O(log n) ] If you use a hashmap > and store frequencies, and each time mostFrequent is called, do a linear > search on the map, it will have the same complexity. Can anyone come up with > a better solution? > > > Karthik R, > R&D Engineer, > Tejas Networks. > > > > On Wed, Sep 7, 2011 at 8:49 AM, *$* <[email protected]> wrote: > >> HI, >> Need logic to implement a stack which should support push , pop , top as >> well as mostFrequent. mostFrequent should return the most frequently pushed >> element. >> >> I have provided the following logic >> have one general stack implementation and one Heap .. (Heapify based on >> frequeny not based on element value) >> >> can any one tell me the time complexity for the above logic .. as well as >> any other good algo for the same. >> >> Thx, >> --Gopi >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
