Minimum edit distance | Dynamic programming | Backtracking

This video gives a very clear explanation about how to find minimum number of operations (insert, remove, replace) in order to convert string S1 to string S2. I have explained all the cases along with boundary cases for this problem. I have first explained it first by using backtracking along with the reason for not using this method and how to convert it to a backtracking problem in order to highly improve in terms of both TIME & SPACE. I hope you will enjoy watching this video as much as i enjoyed making it. CODE LINK is shared below. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

[muskan]

Everyone is gangsta until TECH DOSE comes in to explain dp problems :)
Thanks for these amazing videos and full walk through of the problems.

[DavidCastro-sniy]

This explanation was just amazing! i checked this problem in "a paid platform" which contains an explanation video, it never mentions why the minimum btw three operations in the dp table and why it builds the dp table using the strings in such a way. Explaining bases cases, then recursion, then memoization and ending with DP it's just mind blowing. I did twice this problem, checked two other videos (which were not good ad all) and didn't understand the relations and this one is just awesome. TECH DOSE amazing way to explain and amazing video

[logicfx]

I really feel bad that I'm paying college for those professors who don't even know how to teach, and this guy is teaching me way more than they ever could.
when I'll get a job I'll surely comeback and meet you anyhow to give you gurudakshana.

[Kidpunk]

Dude! You are literally the best. After 5 days of obsessing over this and trying to understand this, your video finally helped me! You covered every part of this question in such an amazing way. You made sure to go over the pre-requisite trivial cases(base cases) first, and then you showed each operation and how it flows logically using the words only, and then you did the tree and matrix. What I love about you is that you refer back to your explanations in order to tie the later stages of the problem with the earlier building blocks. Nobody, literally no other video explained why the left cell, upper cell, and diagonal cell represent what they do, but you made sure to draw the words again and show exactly what was happening. SO happy right now, its been days trying to figure this out haha.

[aakashjain]

Best explanation. This video comes on 5th number in search missed earlier when I tried this problem and couldn't understand . Should be on top. Thanks anyways.

[saipradeepkrishnamurthy]

Extraordinary explanation. For me, Edit distance algo was quite hard to understand, you made it easy.Thank you!

[SakshiVermajourney]

Binge-watching your videos for interviews tomorrow. Your videos are probably the best I have seen in last 3 years.

[anuragphadnis]

Great explanation. Earlier I saw people directly draw matrix and fill it up without proper explanation.

[AbhishekPatel-sdmf]

Best Video explanation for this problem, earlier I watched two videos and both of them directly jumped to dp solution without explaining the concept.
You started it from backtracking and ended it to dp in a very clear way.
Great work

[siddharthachatterjee]

Every single video of TECH DOSE is extremely informative. The explanations are very clear. Thanks Sir for the videos.

[prodiptamondal]

This is the best video of edit distance among all the videos i have watched. Thanks a lot.

[noobninja]

wow this is the best way of explanation, before this i watched 3 vid but still was unable to understand, thanks a lot sir, u r great, may god give u everything u want

[kaustavsarkar]

one of the best channels on youtube for algorithms
keep up the good work :)

[rajeshbammidy]

The best explanation ever you get online
Please keep doing more videos!

[manishkumar-qnlx]

This is the best explanation video on internet for this question!! Thank you sir!!

[qjhlxbq]

Thank you baba. I was stuck trying to connect the dots on how R(m, n) connected with R(m-1, n) (removal/deletion operation), R(m, n-1) (insertion operation), R(m-1, n-1) (replacement operation).
Your video helped me understand how these concepts work in minimum edit distance!

[bhaveshkumar]

best explanation of underlying concepts as to what actually is insertion and deletion with respect to this problem .

[MadForCs]

aapke charan kahan hai prabhu ??? very nice explanation. I respect you very much, sir. You are my hero.

[ShivangShandilyaa]

I just dont hv words sir this was such an amazing Hats Off

[babulbhanu]

Thanks a lot for explaining why we took min of all three values . You are the best, deep diving in the question is must and you do it beautifully