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?