#72
Edit Distance
specialist · 705 · lc medium +30 · verified · 60.2% accepted · 16,349 likes · top 59%
Description
Return the minimum number of single-character operations — insertions, deletions, or replacements — needed to convert word1 into word2.
Example 1:
Input: word1 = "horse", word2 = "ros"
Output: 3
Explanation:
horse -> rorse (replace 'h' with 'r')
rorse -> rose (remove 'r')
rose -> ros (remove 'e')
Example 2:
Input: word1 = "intention", word2 = "execution"
Output: 5
Explanation:
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')
Code
1
2
3