Pregunta de entrevista de DoorDash

Longest increasing subsequence in matrix LC problem