D
denis_browne
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?
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?