# longest common subsequence

I am trying to find longest common subsequence of two strings. I think I have implemented correct logic but it is giving wrong input for a test case. Can someone tell me what's the problem with this code? s = "abcde" t = "acek" it should give 3 for the above test case https://code.sololearn.com/c9O28zPF55i2

2/16/2022 5:10:01 PM

Gajendra Sonare1 Answer

New Answer