Computer Forums - View Single Post

manu2011 · 03-18-2005, 06:09 PM

Please help me with this one:

if s1 and s2 are two strings. we say that we extend s1 if we add a letter at the beginning or at the end of s1, but not in middle.
Ex: if s1=ababc. then both xababc and ababcx extend s1.

i have to design the best algorithm that checks if we can get from s1 to s2 by a sequence of extensions.

thanks

03-18-2005, 06:09 PM	#1 (permalink)
manu2011 Newb Techie Join Date: Mar 2005 Posts: 3	help with an algorithm Please help me with this one: if s1 and s2 are two strings. we say that we extend s1 if we add a letter at the beginning or at the end of s1, but not in middle. Ex: if s1=ababc. then both xababc and ababcx extend s1. i have to design the best algorithm that checks if we can get from s1 to s2 by a sequence of extensions. thanks