25. Min. No. of Insertion & Deletion to convert String a to String b

25. Minimum Number of Insertion and Deletion to convert String a to String b
Video Link : https://youtu.be/-fx6aDxcWyg
GFG practice link : 

Code ---->>>>>>>


int minOperations(string str1, string str2) 
	{ 
	   
	   int n=str1.length(),m=str2.length();
	   
	    vector<vector<int>> t (n+1, vector<int> (m+1)); 
	   
	  
	   
	   for(int i=0;i<n+1;i++){
            t[i][0]=0;
            
        }
        
        for(int j=0;j<m+1;j++)
        {
            t[0][j]=0;
        }
        
        
        for(int i=1;i<n+1;i++)
        {
            
            for(int j=1;j<m+1;j++)
            {
                
                if(str1[i-1]==str2[j-1])
                {
                    t[i][j]=1+t[i-1][j-1];
                }
                else{
                    t[i][j]= max(t[i][j-1] , t[i-1][j]);
                }
                
            }
            
        }
        
	   int count= t[n][m];
	  
	   int ans= n-count + (m-count);
	   
	   return ans; 
	    
	    
	}