Please provide me some hints to solve this problem

#1

I have uderstood this question but unable to make any speculation as how to change numbers in array

#2

Hey @KetanPandey
Check this

#3

Not got an idea,please explain inn detail

#4

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]

Time complexity = O(n * m * k)