Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [7333, 505, 1903, 2807, 7295, 'd', 3373, 3485, 6841, 'T', 'f', 'j', 'U', 589, 'F', 715, 's', 'O', 'r', 'z', '7653', 'I', 't', 'w', '8935', 'C', '6581', '2143', '4053', 'm', '3821', 'Z', 'X', '2827', 'v', 'o', 1195], [1223, 5367, 6431, 'U', 283, 'P', 't', 'Q', 'X', 'O', 's', 'O', 'r', 'z', '7653', 'I', 't', 'w', '8935', 'C', '6581', '2143', '4053', 'm', '3821', 'Z', 'X', '2827', 'v', 'v', 'd', 'X', 8557, 'c', 6857, 5961, 'z', 5351, 'C', 5401, 5497, 2131, 8579, 'U', 'd', 'R']
Output:
s, O, r, z, 7653, I, t, w, 8935, C, 6581, 2143, 4053, m, 3821, Z, X, 2827, v