Hard · Matrices

Longest increasing path

Given an m × n integer matrix mat, return the length of the longest path whose values strictly increase, where each step moves to the cell directly above, below, left or right (no diagonal moves, no wrap-around).

[[9,9,4],[6,6,8],[2,1,1]]

[[3,4,5],[3,2,6],[2,2,1]]