The Question is Wrong!

#1

I got only 50% marks for the question as one of the test cases was failing. On further dive deep: I could see the below observation:

TEST CASE WHICH IS FAILING:

STRING A:
qwertyuioplmznchskalcmnbxghfjtklmnzxcbvnmjkanslpaoutrinvmakldkslqwertyuioplmznchskalcmnbxghfjtklmnzxcbvnmjkanslpaoutrinvmakldkslqwertyuioplmznchskalcmnbxghfjtklmnzxcbvnmjkanslpaoutrinvmakldkslqwertyuioplmznchskalcmnbxghfjtklmnzxcbvnmjkanslpao

STRING B:

lakdmshvndmxnvjrtyuiopqwertlakdmshvndmxnvjrtyuiopqwertdkslpensismfnvheksndertdkslpensismfnvheksndertdkslpensismfnvheksnd

MY ANSWER: lmshvnmnvrtyuioplmshvnmnvrtyuioplnsmnhknkslpinvkdksleismfnvkn

CODING BLOCKS ANSWER:

lakmvnmnvrtyuioplakmvnmnvrtyuioplnsmfnvksndksleimnhkntklmnvks

The length of both the LCS is same which is 61. So, this case has 2 LCS with same length. Please get this question corrected and provide me full marks.

#2

It is clearly written in question that there is just one longest common substring. I think there’s some mistake in your code.

#3

I have verified that the answer which is printed by my code is right and it is a common subsequence.

#4

Can you please post your code?

#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.