Lcs Of Three Strings
medium
1. You are given three strings s1, s2 and s3. 2. You have to find the longest common sub-sequence in the given strings.
Constraints
1 < length of strings <= 100
Format
Input
3 Strings s1, s2 and s3.
Output
Check the sample output and question video.
Example
Sample Input
pepforpepcoders
pepcoding
opepper
Sample Output
3