Extend the program from the case study so that it can find all substrings of length greater than k common to both strings.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.