Edit Distance - Dynamic Programming

[@AmitKashyap-cv6oz]

Very Confusing

[@yardenm15]

nice video. Though there is a mix up with indices in the definition of the cost from A to B (i,j). Should be the other way around.

[@Catherine-h6v]

Your videos really help a lot. Thanks!

[@S4sent]

thanks, dude those copy, ins, del annotations helped a loy

[@alexanderkuptsov6117]

KNI and NI - Do we really copy anything here? If we what to go from KNI to KI, we need to delete N, if we want to go from KI to KNI, we need to insert N. Am I right?

[@mayankagrawal2795]

Great work !!

[@randomguy4953]

Such a awesome video....

[@jamesqiu6715]

explain for me please, how could this happen based on your notations: @06:50 transfer A to B at cost

[@mfrice]

The video should introduce the recursion algorithm first and then the dynamic programming. If you don't have some basic knowledge of edit distance algorithm, this video is really confusing.

[@杨明雄-e3w]

i perfer to know why you choose the 2 dim board?

[@brunonegraozica5459]

Thank you for the video.

[@etotouka857]

excellent!

[@Escape-vt5vs]

James gordon levitt with wig explaining DP :D

[@huxi8070]

Hmm, I do not understand it fully. For example: What question are you asking in the cell [E,N] when trying to find out, what operations need to be done?