Find length of longest subsequence
Submissions: 897   Accuracy:


  Difficulty: Easy   Marks: 2

Given two string X and Y. The task is to find the length of longest subsequence of string X which is substring in sequence Y.

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains integers N and M denoting the length of strings X and Y.  

The second line of each test case contains the two strings X and Y. The strings X and Y consist of only lower case english alphabets.

Output the length of the longest subsequence of string X which is also a substring of Y. Print the answer in a new line for each test case.

1<= T <=100
1<= N, M <=1000

4 8
abcd bacdbdcd


** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra
Author: sujnesh

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Need help with your code? Please use, generate link and share the link here.

to report an issue on this page.