search

metoop / Dynamic-programming

MIT License
2 stars 7 forks source link

Edit Distance in C++ #2

Closed pradeexsu closed 4 years ago

pradeexsu commented 4 years ago

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:

    Insert a character
    Delete a character
    Replace a character

Example 1:

Input: word1 = "horse", word2 = "ros"

horse -> rorse (replace 'h' with 'r')
rorse -> rose (remove 'r')
rose -> ros (remove 'e')

Example 2:

Input: word1 = "intention", word2 = "execution"
intention -> inention (remove 't')
inention -> enention (replace 'i' with 'e')
enention -> exention (replace 'n' with 'x')
exention -> exection (replace 'n' with 'c')
exection -> execution (insert 'u')

refer Edit Distance

himanisuthar commented 4 years ago

@sutharp777 i want to work on this issue