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]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
