When both the character is same

#1

when both the character is same , the condition that sir given in video os wrong , i think the coreect is given below
correction:- if( inp[i-1]==out[j-1] ){ dp [ i ][ j ] = dp [ i-1 ][ j-1 ] ; }

please check whether i am correct or not

1 Like
#2

please do provide the video link also from which your asking your doubts…

#3

in the competetive programming course

#4

cp course of edit distance dp question

#5

both are correct . In the video while explaining Memoization - Top Down approach is used in which if character is same we increase both i and j. And the condition you have given here is of Bottom Up approach i.e. Tabulation.

#6

You are correct.
Reference: https://discuss.codechef.com/t/wa-edit-distance-edist-spoj/26657/2?u=hetp111

1 Like
#7

The bottom up is incorrect.
refer: https://discuss.codechef.com/t/wa-edit-distance-edist-spoj/26657/2

1 Like
#8

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

#9

@hetp111 what do you mean by saying bottom up is incorrect ?

#10
#11

okay i thought he was asking about top down approach. I Didn’t notice this in the video i will ask the admin to resolve it.