A string is said to be a child of a another string if it can be formed by deleting 0 or more characters from the other string. Letters cannot be rearranged. Given two strings of equal length, what's the longest string that can be constructed such that it is a child of both?
These strings have two children with maximum length 3,
ABD. They can be formed by eliminating either the
C from both strings. Return .
Complete the commonChild function in the editor below.
commonChild has the following parameter(s):
- string s1: a string
- string s2: another string
- int: the length of the longest string which is a common child of the input strings
There are two lines, each with a string, and .
- where means "the length of "
- All characters are upper case in the range ascii[A-Z].
The longest string that can be formed by deleting zero or more characters from and is , whose length is 2.
Sample Input 1
Sample Output 1
and have no characters in common and hence the output is 0.
Sample Input 2
Sample Output 2
The longest string that can be formed between and while maintaining the order is .
Sample Input 3
Sample Output 3
is the longest child of the given strings.