Cascadiq
← Problems

Edit Distance

algorithm · Level 3 · 40 min

Description

Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.

You have the following three operations permitted on a word:

  • Insert a character
  • Delete a character
  • Replace a character

Requirements

  • Implement a function that takes word1 and word2 (strings).
  • Return the minimum number of insert, delete, or replace operations.

Constraints

- `0 <= word1.length, word2.length <= 500` - `word1` and `word2` consist of lowercase English letters.

Deliverables

Return the minimum edit distance (Levenshtein distance).

Tags

StringDynamic Programming