Jump to navigation Jump to search
SPOJ EDIST- Edit Distance
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.
1 FOOD MONEY