Skip to content

Commit e736b26

Browse files
committed
Add question
1 parent 028a2ce commit e736b26

File tree

2 files changed

+5
-1
lines changed

2 files changed

+5
-1
lines changed

day8/README.md

Lines changed: 5 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@ three edits:
1717
2. sitt**e**n → sitt**i**n (substitution of "i" for "e")
1818
3. sittin → sittin**g** (insertion of "g" at the end).
1919

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

2222
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.
2323

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

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

41+
Read more at [Wikipedia](https://en.wikipedia.org/wiki/Levenshtein_distance)
42+
43+
![ques](./ques.png)
44+
4145
## JavaScript Implementation
4246

4347
### [Solution](./JavaScript/sol.js)

day8/ques.png

1.21 MB
Loading

0 commit comments

Comments
 (0)