diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/levenshtein-distance.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/levenshtein-distance.md index 104543d9d00..456f5c33c0d 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/levenshtein-distance.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/levenshtein-distance.md @@ -8,7 +8,7 @@ dashedName: levenshtein-distance # --description-- -In information theory and computer science, the **Levenshtein distance** is a [metric]() for measuring the amount of difference between two sequences (i.e. an [edit distance]()). The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character. +In information theory and computer science, the **Levenshtein distance** is a metric for measuring the amount of difference between two sequences (i.e. an edit distance). The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character. Example: