25 min no. of insertion and deletion.cpp

int lcs(int n, int m, string s1, string s2){
        
// make table size depend on change input/variable 
        int t[n+1][m+1];

//intializing first row and first col based on base condition of recusive solution 
        for(int i=0; i<n+1; i++){
            for(int j=0;j<m+1; j++){
                if(i==0 || j==0){
                    t[i][j] = 0;
                }
            }
        }
        
// filling other t[][] box    base on choice diagram   
        for(int i=1; i<n+1; i++){
            for(int j=1; j<m+1; j++){
                if(s1[i-1]==s2[j-1]){
                    t[i][j] = 1 + t[i-1][j-1]; 
                }
                
                else {
                    t[i][j] = max( t[i][j-1],t[i-1][j] );
                }
            }
        }
        
        return t[n][m];
    }
    
    
	int minOperations(string str1, string str2) 
	{ 
	    int No_of_deletion = str1.length() - lcs(str1.length(),str2.length(),str1,str2);
	    int No_of_insertion = str2.length() - lcs(str1.length(),str2.length(),str1,str2);
	    
	    return No_of_deletion+ No_of_insertion;
	}