i was explaining the general idea which we generally use with hashing i.e. hashing and counting the all the char and then find which is the repeated character yes u r correct , for the correct solution we should return when we found bitmap set , which is the actual solution :)
On Fri, Jun 8, 2012 at 7:58 PM, partha sarathi Mohanty < [email protected]> wrote: > @saurabh: why would u count all??? just see while counting if the bitmap > is set.. then return the char. > > On Fri, Jun 8, 2012 at 4:33 PM, Saurabh Yadav <[email protected]>wrote: > >> order of hashing and counting is important >> eg. "abba" >> if we do hashing by characters 'a' is stored before 'b' >> and count of both is 2 at the end and when we process this we give result >> 'a' (because 'a' comes before 'b' )which is wrong >> because 'b' is the first repeated character. >> >> >> Thanks & Regards >> Saurabh >> >> -- >> 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. > -- Thanks & Regards Saurabh Yadav -- 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.
