Practice Longest Increasing Path in a Matrix
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Hard#329
LeetCode ProblemLongest Increasing Path in a Matrix
Problem Statement
Given an m x n integers matrix, return the length of the longest increasing path in matrix. From each cell, you can either move in four directions: left, right, up, or down. You may not move diagonally or move outside the boundary (i.e., wrap-around is not allowed).
Source: Longest Increasing Path in a Matrix on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
matrix = [[9,9,4],[6,6,8],[2,1,1]]
Output
4
# Example 2
Input
matrix = [[3,4,5],[3,2,6],[2,2,1]]
Output
4
# 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
Related LeetCode Problems
Practice more problems similar to Longest Increasing Path in a Matrix.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.