Longest Common Subsequence Problem Statement

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

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

Example:

Input:

T = 1
STR1 = "abcde", STR2 = "ace"

Output:

3

Explanation:

The longest common subsequence is "ace" with length 3.

Constraints:

• 1 <= T <= 50
• 1 <= |STR1| <= 10^2
• 1 <= |STR2| <= 10^2
• Where |STR1| and |STR2| denote the length of STR1 and STR2 respectively.
• Time Limit: 1 sec