Given 3 strings A, B and C, the task is to find the longest common sub-sequence in all three given sequences.
Input: A = "geeks", B = "geeksfor", C = "geeksforgeeks" Output: 5 Explanation: "geeks"is the longest common subsequence with length 5.
Input: A = "abcd", B = "efgh", C = "ijkl" Output: 0 Explanation: There's no common subsequence in all the strings.
You don't need to read input or print anything. Your task is to complete the function LCSof3() which takes the strings A, B, C and their lengths n1, n2, n3 as input and returns the length of the longest common subsequence in all the 3 strings.
Expected Time Complexity: O(n1*n2*n3).
Expected Auxiliary Space: O(n1*n2*n3).
1<=n1, n2, n3<=100
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes