Leetcode 329. Longest Increasing Path in a Matrix

Given an m x n grid, return the length of the longest strictly increasing path you can make by moving up/down/left/right; the core challenge is finding the longest path in the directed acyclic graph formed by strictly increasing neighbor edges, typically solved with DFS+memoization or DP/topological ordering.