Skip to main content

EDIT DISTANCE PROBLEM - LEETCODE 72

 

Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.

You have the following 3 operations permitted on a word:

  1. Insert a character
  2. Delete a character
  3. Replace a character

Example 1:

Input: word1 = "horse", word2 = "ros"
Output: 3
Explanation: 
horse -> rorse (replace 'h' with 'r')
rorse -> rose (remove 'r')
rose -> ros (remove 'e')
Solution:- class Solution {
    public int minDistance(String word1, String word2) {
        
        if(word1.length()==0){
            return word2.length();
        }
         
        if(word2.length()==0){
            return word1.length();
        }
        if(word1.length()==0 && word2.length()==0){
            return 0;
        }
        
        int[][] result=new int[word1.length()+1][word2.length()+1];
        
        for(int i=0;i<=word1.length();i++){
            result[i][0]=i;
        }
            
          for(int j=0;j<=word2.length();j++){
            result[0][j]=j;
        }
        
        for(int i=1;i<=word1.length();i++){
            
           // System.out.println(" row "+i);
            
         for(int j=1;j<=word2.length();j++){
            
                if(word1.charAt(i-1)==word2.charAt(j-1)){
                 //   System.out.println("true");
                    result[i][j]=result[i-1][j-1];
                }
             else{
                 int min=Math.min(result[i-1][j],result[i][j-1]);
                 result[i][j]=Math.min(min,result[i-1][j-1])+1;
                // System.out.println("result[i][j] "+result[i][j]);
             }
        }
            
        }
        
        return result[word1.length()][word2.length()];
        
    }
}



https://leetcode.com/problems/edit-distance/

Comments

.

Popular posts from this blog

Best LeetCode Lists for Interviews

Here is a list of some of the best questions asked in interviews:-  Must do 75 https://leetcode.com/list/5hkn6wze/ Must do 60  https://leetcode.com/list/5eie1aqd/ Must do medium:-  https://leetcode.com/list/5xaelz7g/ Must do Easy:-   https://leetcode.com/list/5r7rxpr1/ Graph:-  https://leetcode.com/list/x18ervrd/  Dynamic Programming:-    https://leetcode.com/list/x14z0dxr/  FaceBook interviews:- https://leetcode.com/list/xyu98pv6/  Amazon Interviews:-  https://leetcode.com/list/5hkniyf7/  Google Interviews:- https://leetcode.com/list/xyu9xfo1/ https://github.com/nazarmubeen/TopProblems/blob/master/README.md

Merge Sort Implementation in JAVA

Merge Sort  is a technique of sorting data with below steps:- 1) Divide the data recursively until it can not  divide more. 2)  Compare the data and sort it. 3) Merge the data again . /* * Merge Sort is based on the concept below points:- * 1) Divide array until it can not be divide. * 2) Merge it again in sorted pattern * * */ public class MergeSort { public static int [] mergeSort ( int arr []) { //check for size if it is one then already sorted int size = arr . length ; if ( size == 1 ) { return arr ; } //find middle (divide an array into two half) int mid = size / 2 ; //first half int [] fhalf = new int [ mid ]; //second half int [] shalf = new int [ size - mid ]; // Copy first half of the array for ( int i = 0 ; i < mid ; i ++) { fhalf [ i ] = arr [ i ]; } // Copy second half of the array for ( int i = mid...