Longest Increasing Path in a Matrix
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.

30:00

Longest Increasing Path in a Matrix
hard
Topics
Companies

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.

Example 1:
Input: [[9,9,4],[6,6,8],[2,1,1]]
Output: 4
Constraints:

  • m==matrix.lengthm == \text{matrix.length}

  • n==matrix[i].lengthn == \text{matrix}[i].\text{length}

  • 1≤m,n≤2001 \leq m, n \leq 200

  • 0≤matrix[i][j]≤231−10 \leq \text{matrix}[i][j] \leq 2^{31} - 1

Input
arr =[[9,9,4],[6,6,8],[2,1,1]]

Initialize DFS with memoization

Input Matrix

9

9

4

6

6

8

2

1

1

Memo (longest path from cell)

-

-

-

-

-

-

-

-

-

Longest Increasing Path: 0

Current

Exploring

Longest Path

Variables
No variables to display
DepthFunction Call
Stack empty
0/10