I've been struggling writing dynamic programming algorithm code in java that does that following, where the integers are entered by the user:

Assume you have two sequences and of the same length > 1, where each sequence contains integer values. The goal of this problem is to find a subsequence which has the following properties: 1. The subsequence is common to both and . 2. The subsequence length is maximum among any other common subsequences. 3. The subsequence cannot be empty. 4. The values in subsequence S are consecutive values in X and Y.

Example 1:

X={2, 4, 6, 8, 10, 12, 14, 16, 18, 20}

Y={13, 15, 18, 1, 3, 5, 8, 10, 12, 20}

Longest common subsequence is S={8, 10, 12}

with length 3.

n = 3 i = 4 j = 7