Skip to content

Commit

Permalink
Add question
Browse files Browse the repository at this point in the history
  • Loading branch information
MadhavBahl committed Dec 31, 2018
1 parent 028a2ce commit e736b26
Show file tree
Hide file tree
Showing 2 changed files with 5 additions and 1 deletion.
6 changes: 5 additions & 1 deletion day8/README.md
Expand Up @@ -17,7 +17,7 @@ three edits:
2. sitt**e**n → sitt**i**n (substitution of "i" for "e")
3. sittin → sittin**g** (insertion of "g" at the end).

## Levenshtein distance (source: [Wikipedia](https://en.wikipedia.org/wiki/Levenshtein_distance))
## Levenshtein distance

Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other. It is named after the Soviet mathematician Vladimir Levenshtein, who considered this distance in 1965.

Expand All @@ -38,6 +38,10 @@ is the distance between the first `i` characters of `a` and the first

Therefore, the minimum edit distance between `a` and `b` is the last element in the edit distance matrix

Read more at [Wikipedia](https://en.wikipedia.org/wiki/Levenshtein_distance)

![ques](./ques.png)

## JavaScript Implementation

### [Solution](./JavaScript/sol.js)
Expand Down
Binary file added day8/ques.png
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.

0 comments on commit e736b26

Please sign in to comment.