A Rust lib and program that compute the Levenshtein distance between two strings. It is the minimum number of operations to change one sequence into the other. The operations are the insertion, deletion or substitution of one character. For example, the distance between "car" and "cat" is 1, between "cat" and "cast" is 1, between "kitten" and "sitting" is 3.
I wrote this as an exercise when learning Rust in 2019, and stumbled upon it a few years later.