1 test case is not passing

#1
#2

As mentioned in the problem statement, given problem is quite similar to the standard LCS problem. We can have following dp state DP(n,m,k) = denotes LCS for first n number of first array, first m numbers of second array when we are allowed to change at max k numbers in first array.

Recursion look like this ->
DP(n,m,k) = max(DP(n-1,m,k), DP(n, m-1, k), DP(n-1, m-1, k-1)+1), if arr[n]!=arr[m]
DP(n,m,k) = max(DP(n-1,m,k), DP(n, m-1, k), DP(n-1, m-1, k)+1), if arr[n]==arr[m]
The total number of distinct states, hence are = n * m * k
Time complexity = O(n * m * k)

code --> https://ide.codingblocks.com/s/622159

#3


i have used the same logic, output is coming out to be correct but 1 test case is failing

#4

yes code seems correct only… let me check with some test cases…

#5

sir did you find anything??

#6

is ur doubt cleared?? i can see u have successfully submitted the code and gained full points…

#7

yes sir the test case somehow automatically passed after few hours

#8

ok… cool… there might be some issue from backend

#9

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.