Could anyone of you elaborate on how to implement the algo ? On Sun, Aug 22, 2010 at 11:56 AM, Ukil <[email protected]> wrote:
> use suffix trie. > > On Aug 16, 9:36 pm, ashita dadlani <[email protected]> wrote: > > You have a string say "foobarfoo" in which "fo" and "oo" aree repeated > > twice.You have to find all such repeated pairs in O(n) time,The string > can > > only have alphanumeric elements in it. > > -- > 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]<algogeeks%[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.
