Alyona and strings problem

#1

i am not able to understand the explanation to this problem can u plz elaborate a little bit more??

#2

@Shobhit_kumar hi,Givenyou, two of the length is equal to 1000 of the string, you want to find in the first string k consecutive substrings, and these strings appear in the second string and the same order, ask the maximum length and the string.
This problem is equivalent to the extension of the longest common sub-sequence, we use a four-dimensional array to transfer the state, one or two-D to compare the first string of the I-bit and the second string of the J-bit, the third dimension that has been assigned to the

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.