-
January 20th, 2009, 10:49 AM
#1
comparing strings
x1, x2 are two strings. you should find what is the length of the largest substring of x2 containing only letters from x1. For example: if x1="abc" and x2="cvbaacdab" the answer will be 4 because "baac" is the largest substring.
can you help me find a recursive way (no loops please) to find the answer?
Tags for this Thread
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|