Domanda di colloquio di DoorDash

Longest increasing subsequence in matrix LC problem