@bharat take two hashmaps of hash1<data, freq> and hash2<freq,linked_list> take frequency of a data from hash1, and find its list in hash2. if ur poping, reduce frequency in hash1 and in corresponding hash2 remove its entry in that list and put it in freq-1 entry and keep track of max and second max of highest frequncy value of hash2 in vars max and second_max
surender On Fri, Sep 9, 2011 at 11:42 AM, bharatkumar bagana < bagana.bharatku...@gmail.com> wrote: > @surender: say the hash table of <freq,linked_lis> is as follows... > <1,2->3->4> > <2,5->6> > <3,7->8> > pop(7) would decrease the frequency of element 7 means that element has to > be added to 2nd key i.e <2,5->6->7> here > how do u get the element 7 from hash table as freq is the key element in > u'r table? > And after getting element u have to add 7.... > LinkedList linked_list=hash.get(new_freq(7)); > linked_list.addLast(7); > hash.add(new_freq(7),linked_list); > Any better approach? > > > On Fri, Sep 9, 2011 at 11:09 AM, surender sanke <surend...@gmail.com>wrote: > >> 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 <k4rth...@gmail.com> 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, *$* <gopi.komand...@gmail.com> 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 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. >>>> >>> >>> -- >>> You received this message because you are subscribed to the Google Groups >>> "Algorithm Geeks" group. >>> 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. >>> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> 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. >> > > > > -- > > **Please do not print this e-mail until urgent requirement. Go Green!! > Save Papers <=> Save Trees > *BharatKumar Bagana* > **http://www.google.com/profiles/bagana.bharatkumar<http://www.google.com/profiles/bagana.bharatkumar> > * > Mobile +91 8056127652* > <bagana.bharatku...@gmail.com> > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > 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. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. 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.
