Longest Common Subsequence Problem Statement

Given two strings STR1 and STR2, determine the length of their longest common subsequence.

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements. A common subsequence is one that appears in both strings.

Input:

The first line contains an integer T denoting the number of test cases. Each test case consists of two space-separated strings STR1 and STR2.

Output:

Print the length of the longest common subsequence for each test case on a separate line.

Example:

Input:

STR1 = "abcde", STR2 = "ace"

Output:

3

Explanation:

The longest common subsequence is "ace", which has a length of 3.

Constraints:

• 1 <= T <= 50
• 1 <= |STR1| <= 10^2
• 1 <= |STR2| <= 10^2
• Time Limit: 1 sec

Note:

You are required to implement the function. Printing of results will be handled elsewhere.