Coding Interview Question | Minimum Edit Distance | Dynamic Programming with Optimization

LeetCode Link - https://leetcode.com/problems/edit-di... InterviewBit Link - https://www.interviewbit.com/problems... Guys, I have made a mistake I in this video. I have forgotten to check the first case at 20:32. The character n is common in both strings. So, the value of M[5][4] will be 2 and final answer will be 3. I am not putting down the video since I think explanation is quite clear and it was a genuine mistake. I hope it doesn't trouble you guys. Sorry about the same. Will be more careful from now on! :) The video includes following details- 0:00-0:29 - Question with example 0:29-1:45 - Which string to convert 1:45-2:48 - Why dynamic programming 2:48-3:43 - Visualisation of dp 3:43-5:43 - Initial conditions 5:43-9:40 - Algorithm Formation 9:40-21:06 - Dry run and detailed explanation 21:06-21:43 - Take any string as source 21:43-22:00 - Complexities 22:00-22:40 - Space Optimization Please subscribe to my channel -    / keertipurswani   LinkedIn -   / keertipurswani   Instagram - https://www.instagram.com/keerti.purs...