Pregunta de entrevista de Infosys

finding longest common subsequence between two substring