Longest Common Subsequence Problem Statement

Given two strings, S and T with respective lengths M and N, your task is to determine the length of their longest common subsequence.

A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous. For example, in the string "abc", the subsequences include "", "a", "b", "c", "ab", "bc", "ac", "abc", among others.

Input:

The first line contains the string 'S' of length 'M'.
The second line contains the string 'T' of length 'N'.

Output:

Return the length of the Longest Common Subsequence as an integer.

Example:

Input:

S = "abcde"
T = "ace"

Output:

3

Explanation:

The Longest Common Subsequence is "ace".

Constraints:

• 0 ≤ M ≤ 103
• 0 ≤ N ≤ 103
• Time Limit: 1 second