Скачать или смотреть Facebook Dynamic Programming Interview Problem | Levenshtine Distance | LeetCode 72: Edit Distance

In this episode, we solve LeetCode 72 where we are given two words and asked how many operations needed to get one word from the other. We solve this using the Levenshtine Distance Concept. We use python 3. Watch and enjoy!

My Other Channel:    / @disrupted572  

Top Software/ Coding Channels:
   / @csdojo  
   / kevinnaughtonjr  
   / @jomakaze  
   / @techlead  

Top Python Coding Channels:
   / @neetcode  
   / @timc3406  

Twitter:   / realchrisibe  
Instagram:   / christopher_ibe  
Facebook:   / christopher.ibeekeocha  
Snapchat: @christopheribe
LinkedIn:   / christopher-ibe-ekeocha  

Question Link: https://leetcode.com/problems/edit-di...

Problem Statement:
Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.

You have the following three operations permitted on a word:
Insert a character
Delete a character
Replace a character

Example 1:
Input: word1 = "horse", word2 = "ros"
Output: 3
Explanation:
horse - rorse (replace 'h' with 'r')
rorse - rose (remove 'r')
rose - ros (remove 'e')

Example 2:
Input: word1 = "intention", word2 = "execution"
Output: 5
Explanation:
intention - inention (remove 't')
inention - enention (replace 'i' with 'e')
enention - exention (replace 'n' with 'x')
exention - exection (replace 'n' with 'c')
exection - execution (insert 'u')