Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [6017, 'm', 1719, 'c', 7959, 7997, 'K', 'L', 5299, 7119, 5183, 'l', 9207, 'P', 3089, 'i', '1433', 'u', 'M', 'B', '7599', 'G', '2349', 'I', 'E', 'S', '1413', '685', '5517', 'B', '4021', 'R', '2955', 'S', 'P', 'f', 4361, 8351, 3703, 'i', 3047, 'c', 8509, 'x', 'O'], ['W', 4265, 'W', 'V', 8913, 3293, 'Z', 'Z', 5671, 'w', 9709, 'k', 'i', '1433', 'u', 'M', 'B', '7599', 'G', '2349', 'I', 'E', 'S', '1413', '685', '5517', 'B', '4021', 'R', '2955', 'S', 'Q', 6041, 'Z', 'C', 'N', 'Y', 7551, 9865, 'H', 'i', 'g', 'y']
Output:
i, 1433, u, M, B, 7599, G, 2349, I, E, S, 1413, 685, 5517, B, 4021, R, 2955, S