**LCS of three strings | Practice | GeeksforGeeks**
https://practice.geeksforgeeks.org/problems/lcs-of-three-strings/0

LCS of three strings. Medium Accuracy: 54.38% Submissions: 10922 Points: 4. Given 3 strings A, B and C, the task is to find the longest common sub-sequence in all three given sequences. Example 1: Input: A = "geeks", B = "geeksfor", C = "geeksforgeeks" Output: 5 Explanation: "geeks"is the longest common subsequence with length 5. â€‹Example 2:

**DA:** 66 **PA:** 29 **MOZ Rank:** 31 **Up or Down:** Up