Longest Increasing Path in a Matrix · Coding Interview Practice

Longest Increasing Path in a MatrixGiven an m x n integer matrix, return the length of the longest strictly increasing path. From each cell you may move up, down, left or right, but not diagonally or outside the matrix.Constraints

m == matrix.length, n == matrix[i].length

1 <= m, n <= 200

0 <= matrix[i][j] <= 2^31 - 1

Examples

Input: matrix = [[9, 9, 4], [6, 6, 8], [2, 1, 1]] Output: 4

Input: matrix = [[3, 4, 5], [3, 2, 6], [2, 2, 1]] Output: 4

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…