help in developing an algorithm

[manu2010]

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

 

[echo47]

If I understand correctly ...
Use your favorite string search function to determine if s1 is a substring of s2. If it is, then s1 can be extended to become s2.

Was that homework?