Faster implementation of Levenshtein distance

Time complexity is now O(len(a)*len(b)), according to me.