Loading problem

Longest Increasing Path in a Matrix

Given an m x n integer `matrix`, return the length of the longest strictly increasing path. From a cell you may move up, down, left, or right (no diagonals, no wrapping).

Figure

row · column

Examples

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

out: 4

1 -> 2 -> 6 -> 9

Constraints

1 <= m, n <= 200
0 <= matrix[i][j] <= 2^31 - 1

Hints

target: O(m*n) time⌘↩ run · ⇧⌘↩ submit