# Using Dynamic Programming to Calculate Levenshtein Distance in Java

Levenshtein distance is a metric for the distance between two strings. It is defined by three different types of edits: substitution, insertion, and deletion. The Levenshtein distance between two strings is the minimum number of edits to get from one string to the other.

Read more "Using Dynamic Programming to Calculate Levenshtein Distance in Java"