New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Edit Distance

Contributed by

Arshit Babariya

Medium

0/80

Avg time to solve 30 mins

Success Rate 70 %

67 upvotes

Problem Statement

You are given two strings 'S' and 'T' of lengths 'N' and 'M' respectively. Find the "Edit Distance" between the strings.

Edit Distance of two strings is the minimum number of steps required to make one string equal to the other. In order to do so, you can perform the following three operations:

1. Delete a character
2. Replace a character with another one
3. Insert a character

Note:

Strings don't contain spaces in between.

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input format:

The first line of input contains the string 'S' of length 'N'.

The second line of the input contains the String 'T' of length 'M'.

Output format:

The only line of output prints the minimum "Edit Distance" between the strings.

Note:

You do not need to print anything; it has already been taken care of. Just implement the given functions.

Constraints:

0 <= N <= 10 ^ 3
0 <= M <= 10 ^ 3

Time Limit : 1sec

Sample Input 1 :

abc
dc

Sample Output 1 :

Explanation For Sample Input 1 :

In 2 operations we can make the string T to look like string S. First, insert the character 'a' to string T, which makes it "adc".

And secondly, replace the character 'd' of the string T with 'b' from the string S. This would make string T to "abc" which is also the string S. Hence, the minimum distance.

Sample Input 2 :

whgtdwhgtdg
aswcfg

Sample Output 2 :

Auto

Console