Edit Distance or Levenshtein Distance in an Easy Recursion + Memoization Way

Edit Distance, also known as Levenshtein Distance, is a common problem where we need to find the minimum number of operations required to convert one string into another. The three allowed operations are: Insert a character Delete a character Replace a character For example: word1 = "horse" word2 = "ros" Output: 3 We can convert "horse" into "ros" using three operations: Replace h with r: "rorse" Delete r: "rose" Delete e: "ros" Let's solve this problem using recursion +