Edit Distance (convert two one string to another in minimum opearation)

 

Intuition :

  • Here we have to find the minimum edit distance problem between two strings word1 and word2.
  • The minimum edit distance is defined as the minimum number of operations required to transform one string into another.

Approach :

  • The approach here that I am using is dynamic programming. The idea is to build a 2D matrix dp where dp[i][j] represents the minimum number of operations required to transform the substring word1[0...i-1] into the substring word2[0...j-1].

How is Matrix built :

  • The matrix is built iteratively using the following recurrence relation:
  1. If word1[i-1] == word2[j-1], then dp[i][j] = dp[i-1][j-1]. That is, no operation is required because the characters at positions i-1 and j-1 are already the same.
  2. Otherwise, dp[i][j] is the minimum of the following three values:
  • dp[i-1][j-1] + 1: replace the character at position i-1 in word1 with the character at position j-1 in word2.
  • dp[i-1][j] + 1: delete the character at position i-1 in word1.
  • dp[i][j-1] + 1: insert the character at position j-1 in word2 into word1 at position i.

The base cases are:

  • dp[i][0] = i: transforming word1[0...i-1] into an empty string requires i deletions.
  • dp[0][j] = j: transforming an empty string into word2[0...j-1] requires j insertions.

Final Step :

  • Finally, return dp[m][n], which represents the minimum number of operations required to transform word1 into word2, where m is the length of word1 and n is the length of word2.

Complexity

  • Time complexity : O(mn)
  • Space complexity : O(mn)

Comments

Post a Comment

Popular posts from this blog

Lowest common ancestor in a binary Tree

Approach Define a recursive function rec that takes three parameters: root (the current node), p (first node to find the lowest common ancestor for), and q (second node to find the lowest common ancestor for). Check if the current node root is null or if it is either p or q . If any of these conditions is true, return the current node root as the lowest common ancestor. Recursively call the rec function for the left subtree of the current node and assign the result to a variable l . Recursively call the rec function for the right subtree of the current node and assign the result to a variable r . Check if both l and r are not null. If so, it means that p and q are found on different subtrees of the current node, and the current node root is their lowest common ancestor. Return the current node root . If l is null, it means that both p and q are on the right subtree (or not present in the tree). Return r . If none of the above conditions are met, it means ...
Read more

New Start day 1 30/09/2020 Codeforces problem 231A Team

Question: source( codeforces: https://codeforces.com/problemset/problem/231/A) Team One day three best friends Petya, Vasya and Tonya decided to form a team and take part in programming contests. Participants are usually offered several problems during programming contests. Long before the start the friends decided that they will implement a problem if at least two of them are sure about the solution. Otherwise, the friends won't write the problem's solution. This contest offers  n  problems to the participants. For each problem we know, which friend is sure about the solution. Help the friends find the number of problems for which they will write a solution. Input The first input line contains a single integer  n  ( 1 ≤  n  ≤ 1000 ) — the number of problems in the contest. Then  n  lines contain three integers each, each integer is either  0  or  1 . If the first number in the line equals  1 , then Petya is sure about the problem's solu...
Read more

New start day 1 : 30/09/2020 (codeforces 71A) Way to long strings

 Question:  source (codeforces: https://codeforces.com/problemset/problem/71/A) Way too long strings   Sometimes some words like " localization " or " internationalization " are so long that writing them many times in one text is quite tiresome. Let's consider a word  too long if its length is  strictly more  than  10  characters. All too long words should be replaced with a special abbreviation. This abbreviation is made like this: we write down the first and the last letter of a word and between them, we write the number of letters between the first and the last letters. That number is in the decimal system and doesn't contain any leading zeroes. Thus, " localization " will be spelled as " l10n ", and " internationalization » will be spelled as " i18n ". You are suggested to automatize the process of changing the words with abbreviations. At that, all too long words should be replaced by the abbreviation and the words th...
Read more