Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [3639, 'V', 'i', 6713, 'g', 3835, 'F', 5903, 7399, 4735, 3661, 'F', 5627, 'X', '5785', 'f', 'G', '6661', '1787', '7855', '683', 'X', '3035', '3827', 'a', 'v', 'm', '1791', '7593', 'U', '9283', 'A', '5207', '3283', 'f', 'H', 7353, 9085, 9147, 1143, 'L', 6997, 7663, 1311, 'P', 2431, 409, 'R', 'P', 739, 'P', 'R', 1247, 'l'], [3035, 1279, 1153, 'D', 4693, 'E', 'v', 'X', '5785', 'f', 'G', '6661', '1787', '7855', '683', 'X', '3035', '3827', 'a', 'v', 'm', '1791', '7593', 'U', '9283', 'A', '5207', '3283', 'f', 'D', 'S', 4759, 'w', 747, 'i']
Output:
X, 5785, f, G, 6661, 1787, 7855, 683, X, 3035, 3827, a, v, m, 1791, 7593, U, 9283, A, 5207, 3283, f