|All-time Popular Problems|
|Construct Tree from Inorder & Preorder|
|Sum of two large numbers|
|Level order traversal in spiral form|
|Spirally traversing a matrix|
|Angle between hour and minute hand|
|Binary Tree to DLL|
|Smallest Positive missing number|
|Height of Binary Tree|
|Largest Number formed from an Array|
Given 3 strings X, Y and Z, the task is to find the longest common sub-sequence in all three given sequences.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains integers n, m and k denoting the length of strings X, Y and Z respectively.
The second line of each test case contains the three strings X, Y and Z. The string consists of only lower case english alphabets.
Print the length of the longest common sub- sequence of the three strings for each test case in a new line.
1<= T <=100
1<= N, M, K <=100
5 8 13
geeks geeksfor geeksforgeeks