LCS DP Problem CPP

#1

https://ide.codingblocks.com/s/291137 code is giving wrong answer, please check it

#2

hello @ashwani225
image

here use i<=n and j<=m

also share the constraint of this question with me

#3


Answer is 4 but my answer is coming 6

#4

image
here u r finding lcs of string with itself .:stuck_out_tongue_winking_eye::stuck_out_tongue_winking_eye:

replace one str2 with str1 and enjoy the output :sunglasses::sunglasses:

#5

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.