19.LCS

--> 19 Longest common subsequence Recursive

Video Link : https://youtu.be/4Urd0a0BNng


Recursive Method Code : 


#include<bits/stdc++.h>
using namespace std;

    
    int longestCommonSubstr (string s1, string s2, int n, int m)
    {
        // your code here
        
        if(n==0 || m==0)
        {
            return 0;
        }
        
        if(s1[n-1]==s2[m-1])
        {
            return 1+longestCommonSubstr(s1,s2,n-1,m-1);
        }
        else
        {
            
            return max(longestCommonSubstr(s1,s2,n,m-1) , longestCommonSubstr(s1,s2,n-1,m));
            
        }
        
        
    }



int main()
{
   
 
    
        int n, m; cin >> n >> m;
        string s1, s2;
        cin >> s1 >> s2;
        

        cout << longestCommonSubstr (s1, s2, n, m) << endl;
     return 0; 
}