Interview question - any suggestions

[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?

[Vladimir S. Oka]

de**********@ho tmail.com wrote:

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?

Giving it a go? And then asking here about specific problems?

BTW, the way you state it, this is a question for comp.programmin g as I
don't see any reference to C.

[Robin Haigh]

<de**********@h otmail.com> wrote in message
news:11******** **************@ j33g2000cwa.goo glegroups.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

[Robin Haigh]

"Robin Haigh" <ec*****@leeds. ac.uk> wrote in message
news:du******** **@news6.svr.po l.co.uk...

<de**********@h otmail.com> wrote in message
news:11******** **************@ j33g2000cwa.goo glegroups.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...

I should also have asked about self-overlapping repeats -- does AAA contain
two instances of AA?

--
RSH

[selvinmani]

Hai friend,
You can always refer to any algorithm books like Computer Algorithms by
Sara Base for any doubts regarding algorithms. I think the answer for
your question is definetly found under the topic String
Matching/Seraching.

[Vladimir S. Oka]

se********@gmai l.com wrote:

Hai friend,
You can always refer to any algorithm books like Computer Algorithms by
Sara Base for any doubts regarding algorithms. I think the answer for
your question is definetly found under the topic String
Matching/Seraching.

Please quote what and who you're replying to. Lurk a while in here
before posting.

[Keith Thompson]

se********@gmai l.com writes:

You can always refer to any algorithm books like Computer Algorithms by
Sara Base for any doubts regarding algorithms. I think the answer for
your question is definetly found under the topic String
Matching/Seraching.

Please read <http://cfaj.freeshell. org/google/>.

--
Keith Thompson (The_Other_Keit h) ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.