Problem 93. Calculate the Levenshtein distance between two strings
63.46% Correct | 36.54% Incorrect
Last Solution submitted on Jun 02, 2023
jj L on 9 Aug 2018
Stephan Allgeier on 10 Jan 2020
I really like this problem. So far, this is the one I had to think about most. Mostly because the straight-forward recursive implementation is simply not feasible for longer inputs.
Roie Knaanie on 15 Oct 2022
This question is a good example of using a bottom-up dynamic programming algorithm.
Solution CommentsShow comments
Problem Recent Solvers1152
Matrix indexing with two vectors of indices
More from this Author96
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!