Pregunta de entrevista de DoorDash

Longest Increasing Path in a Matrix (LeetCode 329 H)