#898Hard#16 in DoorDash's list· asked at 7 companies
Longest Increasing Path in a Matrix
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: matrix = [[9,9,4],[6,6,8],[2,1,1]] Output: 4
The path 1 -> 2 -> 6 -> 9.
Example 2
Input: matrix = [[3,4,5],[3,2,6],[2,2,1]] Output: 4
The path 3 -> 4 -> 5 -> 6.
Example 3
Input: matrix = [[1]] Output: 1
Constraints
- •
m == matrix.length - •
n == matrix[i].length - •
1 <= m, n <= 200 - •
0 <= matrix[i][j] <= 2^31 - 1