Back to problems

Longest Increasing Path in a Matrix

Algorithm · Meta · Hard

For an integer grid named matrix, determine the maximum number of cells in any strictly increasing route. A route may begin and finish at arbitrary cells, and each step can go only to the neighboring cell above, below, left, or right. Every next value on the route must be greater than the preceding value. Input/Output Requirements Input: matrix, a two-dimensional integer array whose dimensions are each in the range [0, 200]. Output: Return an integer equal to the greatest…

Checking your access…