Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['Y', 5323, 4007, 139, 'N', 'j', 'x', 'W', 'q', '5311', 'N', 'n', 'k', '7689', 'H', 'b', '9985', 'T', '3549', '6157', '2479', '7247', '1921', '1489', 'v', 'y', '6649', 'b', '9205', 'V', '8219', '3963', 'F', '7167', 'x', 'X', 'X', 2161], [8503, 's', 8523, 'j', 'x', 'W', 'q', '5311', 'N', 'n', 'k', '7689', 'H', 'b', '9985', 'T', '3549', '6157', '2479', '7247', '1921', '1489', 'v', 'y', '6649', 'b', '9205', 'V', '8219', '3963', 'F', '7167', 'c', 4665, 9045, 'd', 'G', 2073]
Output:
j, x, W, q, 5311, N, n, k, 7689, H, b, 9985, T, 3549, 6157, 2479, 7247, 1921, 1489, v, y, 6649, b, 9205, V, 8219, 3963, F, 7167