Calculates the minimum number of operations required to transform one string into another.
The Edit Distance problem measures the minimum number of operations required to convert one string into another. This algorithm uses a 2D table to store the minimum edit distances between substrings and builds the solution in a bottom-up manner.