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.
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.

Example 1:
Input: [[9,9,4],[6,6,8],[2,1,1]]
Output: 4
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