use suffix trie. On Aug 16, 9:36 pm, ashita dadlani <ash....@gmail.com> 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 algoge...@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.