MAIN8_E - Cover the string
Given two strins A and B. You have to find the length of the smallest substring of A, such that B is the subsequence of this substing.
you have to find the lenght of smallest possible string S such that
S is the substring of A
B is the subsequence S
Note: Subsequence of an string S is obtained by deletnig some (possibly none) of the characters from it. for example "ah" is the subsequecne of "aohol"
First line contains T, the number of test cases. Then T test cases follow, 2 lines for each test case, 1st contains A and 2nd contain B.
For each test case print the answer in a new line. if no such substring exists print -1 instead.
Input: 2 aaddddcckhssdd acs ghkkhllhjkhthkjjht hh Output: 10 3
is it possible to accept d O[N^2] solution??