# Generated by Programming+ from pseudo. Not reviewed for Mojo best practices. # The fewest single-letter edits (substitute, insert, delete) that turn A into B. def edit_distance(a: String, b: String) -> Int: var n: Int var m: Int n = a.count_codepoints() m = b.count_codepoints() var d = List[List[Int]]() for _ in range(n + 1): var _row1 = List[Int]() for _ in range(m + 1): _row1.append(0) d.append(_row1^) for i in range(n + 1): d[i][0] = i for j in range(m + 1): d[0][j] = j for i in range(1, n + 1): for j in range(1, m + 1): var cost: Int if String(a[codepoint=i - 1]) == String(b[codepoint=j - 1]): cost = 0 else: cost = 1 d[i][j] = min(d[i - 1][j] + 1, d[i][j - 1] + 1, d[i - 1][j - 1] + cost) return d[n][m] def main(): print(edit_distance("GATTACA", "GCATGCA"))