Pergunta de entrevista da empresa DoorDash

Longest Increasing Path in a Matrix (LeetCode 329 H)