Python Edit distance algorithm with dynamic programming and 2D Array - Output is not optimal

Question

I have encountered the edit distance (Levenshtein distance) problem. I have looked at other similar stackoverflow questions, and is certain that my question is distinct from