Question

Has anyonce solved py3 problem 3? it looks easy but I don't understand what he actually wanted in "Suppose that the index for the starting point of the match of the first substring is n (which would be an element of starts1), and that the length of the first substring is m. Then if k is an element of starts2, denoting the index of the starting point of a match of the second substring, there is a valid match with one substitution starting at n, if n+m+1 = k, since this means that the second substring match starts one element beyond the end of the first substring."

Answer 1

In hopes of bringing this question back to life, I would like some clarity on the problem as well.