[Problem 141] Slding Window Search

So each position given start a substring Alpha of size X. We are then to search behind the position of Alpha for the biggest subString of Alpha that we can find.

I thought it first it might be to check increasing values of X until you couldn't find a substring start at the position behind. But from the example above testing against "and he told" clearly showed finding substrings that didnt' start at the beginning ("he to", "d_",etc).

So my question is how do you bound the size of X of the initial substring? I mean starting at position 22255 I could just say the substring I'm searching from is the rest of the file, and find a lot of substrings behind position 22255. What limits me to just the string "kable" ?

Ah thanks for the respone. I just read the problem without actually getting the fact that 4 high bits limit us to a 15 byte substring.