Pergunta de entrevista da empresa DoorDash

Longest increasing subsequence in matrix LC problem