Pregunta de entrevista de Amazon

1) DP problem - find the largest common subsequence