Please enter your email address or userHandle.
Given two strings str1 and str2, find the length of the smallest string which has both, str1 and str2 as its sub-sequences.
Note: str1 and str2 can have both uppercase and lowercase letters.
The first line of input contains an integer T denoting the number of test cases. Each test case contains two space-separated strings.
For each testcase, in a new line, output the length of the required string.
Expected Time Complexity: O(Length(str1) * Length(str2)).
Expected Auxiliary Space: O(Length(str1) * Length(str2)).
1 <= T <= 100
1<= |str1|, |str2| <= 100
Test Case 1: One of the shortest answer can be abxycd, which is of length 6.
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.