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.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid March, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 329. Longest Increasing Path in a Matrix

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact