BackTracing of Minimum Edit Distance

Using the Levenshtein distance algorithm to find the minimum edit distance between two strings.

Cost of operations:
insertion = 1
deletion = 1
substitution = 2

Following along this video and the following 3 videos in the play list.

String 1

String 2

Generate Min Generate Max

Default example Bohdan example