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 :)
CODE LINK: https://gist.github.com/SuryaPratapK/...
On this page of the site you can watch the video online Minimum edit distance | Dynamic programming | Backtracking with a duration of hours minute second in good quality, which was uploaded by the user Techdose 25 January 2020, share the link with friends and acquaintances, this video has already been watched 71,640 times on youtube and it was liked by 2.1 thousand viewers. Enjoy your viewing!
