LCS of 3 strings
You don’t have to print anything, it has already been taken care of. Just complete the function. If there is no common subsequence, return 0.
The first line of input contains an integer ‘T’ denoting the number of test cases. The first line of the testcase contains three space-separated positive integers n, m, k denoting the length of the strings A, B, C respectively. The second line of the testcase contains the string A. The third line of the testcase contains the string B. The fourth line of the testcase contains the string C.
For each test case, return the length of the longest common subsequence in all the three strings A, B, and C.
1 <= T <= 5 1 <= n, m, k <= 100 Where ‘T’ is the total number of test cases and n, m, k are the length of strings A, B, and C respectively. Time limit: 1 second
Ninja and Numbers
Longest Palindromic Substring