Edit Distance Between 2 Strings - The Levenshtein Distance ("Edit Distance" on LeetCode)
Free 5-Day Mini-Course: https://backtobackswe.com
Try Our Full Platform: https://backtobackswe.com/pricing
📹 Intuitive Video Explanations
🏃 Run Code As You Learn
💾 Save Progress
❓New Unseen Questions
🔎 Get All Solutions
Question: Write a program that takes two strings and computes the minimum number of edits needed to transform the first string into the second string.
Examples:
Input: "Saturday" and "Sundays"
Output: 4
Why:
In: "Saturday"
1.) Delete the first 'a' ("Sturday")
2.) Delete the first 't' ("Surday")
3.) Replace 'r' with 'n' ("Sunday")
4.) Insert an 's' at the end ("Sundays")
Out: "Sundays"
Our 3 Operations To Fix Character Mismatch:
Insert
Delete
Replacement
++++++++++++++++++++++++++++++++++++++++++++++++++
HackerRank: / @hackerrankofficial
Tuschar Roy: / tusharroy2525
GeeksForGeeks: / @geeksforgeeksvideos
Jarvis Johnson: / vsympathyv
Success In Tech: / @successintech
++++++++++++++++++++++++++++++++++++++++++++++++++
This question is number 17.2 in "Elements of Programming Interviews" by Adnan Aziz, Tsung-Hsien Lee, and Amit Prakash.
Watch video Edit Distance Between 2 Strings - The Levenshtein Distance ("Edit Distance" on LeetCode) online without registration, duration hours minute second in high quality. This video was added by user Back To Back SWE 11 January 2019, don't forget to share it with your friends and acquaintances, it has been viewed on our site 293,338 once and liked it 9.3 thousand people.