Hello Codeforces, i have tried to understand Edit Distance Dynamic Programming classical problem and i tried few tutorials through the internet and i couldn't understand the concept. can any one clarify it to me in very simple way ?
Hello Codeforces, i have tried to understand Edit Distance Dynamic Programming classical problem and i tried few tutorials through the internet and i couldn't understand the concept. can any one clarify it to me in very simple way ?
State with index x, y on table: minimum number of edits required to convert prefix of first string with legth x into prefix of second string with legth y;
Transitions: Possibles operations;
Or try it: http://bfy.tw/6TFq