Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [3149, 4081, 27, 5355, 'I', 5483, 'E', 4929, 4543, 'k', 7655, 9367, 'g', '9733', '6205', 'i', '1185', 'd', '383', '4279', '9959', '4141', 'j', 'w', 'e', '4769', '4851', '2197', '5489', '2511', 'w', '7793', 'E', 'j', '1161', '8817', 'L', 'R', 'u', 7303, 4539, 'F', 'E', 9975], ['L', 2847, 'v', 'K', 5625, 'n', 'S', 'W', 'I', 'p', 'Z', 'C', 947, 's', 'f', 3387, 'n', 'C', 2235, 7963, 5829, 'z', 'P', 2179, 'g', '9733', '6205', 'i', '1185', 'd', '383', '4279', '9959', '4141', 'j', 'w', 'e', '4769', '4851', '2197', '5489', '2511', 'w', '7793', 'E', 'j', '1161', '8817', 'L', 'K', 9293, 6029, 6549, 'r', 'D', 'r', 'K', 'm', 3651, 7297, 'w']
Output:
g, 9733, 6205, i, 1185, d, 383, 4279, 9959, 4141, j, w, e, 4769, 4851, 2197, 5489, 2511, w, 7793, E, j, 1161, 8817, L