<de**********@hotmail.com> wrote in message
news:11**********************@j33g2000cwa.googlegr oups.com...
Hi there,
I got a tough interview questions lately, and I would like to hear
your opinion:
An array of N chars is given
Write an efficient algorithm to find all the repeating substring with a
minimal size
of 2
f.e
ABCFABHYIFAB
sunstrings are:
"AB"
"FAB"
Any suggestions?
FA is repeated as well. AB is different, because there's an additional AB
besides the ones that are part of FAB. These things tend to depend a lot on
the precise problem definition: clarification needed...
--
RSH