SPOJ EDIST

From Algorithmist
Jump to navigation Jump to search

SPOJ EDIST- Edit Distance[edit]

Explanation[edit]

This problem can be solved using dynamic programming with memoization technique. In essence, it is about computing the Edit Distance, also known as, Levenshtein Distance between two given strings.


Input[edit]

1
FOOD
MONEY

Output[edit]

4

Solutions[edit]

F#: 6219. Edit Distance (EDIST) with F#

References[edit]