Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [2159, 'p', 8427, 'w', 7865, 'r', 4811, 'D', 8771, 't', 'T', 'V', 245, 'e', 'I', 'a', 'y', 'O', 'N', 'y', '3205', 'Z', '1883', 'P', 'U', '9125', '1665', 'i', 'i', 'C', 'q', '5783', 'V', 'O', 'E', 'm', 7107, 'o', 'G', 7765, 'l', 1061, 5475, 'b', 6059, 5991, 'x', 5007], [5265, 2975, 73, 9377, 'f', 9137, 'm', 'F', 9047, 'J', 'p', 8117, 7519, 'e', 'I', 'a', 'y', 'O', 'N', 'y', '3205', 'Z', '1883', 'P', 'U', '9125', '1665', 'i', 'i', 'C', 'q', '5783', 'V', 'O', 'F', 8107, 7615, 7917, 's', 5975, 4923, 6797, 'm', 4845, 8143, 'X', 4659]
Output:
e, I, a, y, O, N, y, 3205, Z, 1883, P, U, 9125, 1665, i, i, C, q, 5783, V, O