#+ANKI_DECK: study_deck_02
* TODO 0329. Longest Increasing Path In a Matrix :hard:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*0329. Longest Increasing Path In a Matrix][0329. Longest Increasing Path In a Matrix]]
:END:

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* (i.e., wrap-around is not allowed).

*Example 1:*


#+begin_src
Input: matrix = [[9,9,4],[6,6,8],[2,1,1]]
Output: 4
Explanation: The longest increasing path is [1, 2, 6, 9].
#+end_src


*Example 2:*


#+begin_src
Input: matrix = [[3,4,5],[3,2,6],[2,2,1]]
Output: 4
Explanation: The longest increasing path is [3, 4, 5, 6]. Moving diagonally is not allowed.
#+end_src


*Example 3:*


#+begin_src
Input: matrix = [[1]]
Output: 1
#+end_src


*Constraints:*

 - ~m == matrix.length~

 - ~n == matrix[i].length~

 - ~1 <= m, n <= 200~

 - ~0 <= matrix[i][j] <= 2^{31} - 1~

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python :lc-problem 329 :lc-lang python3
class Solution:
    def longestIncreasingPath(self, matrix: List[List[int]]) -> int:
#+end_src

** TODO C++
#+begin_src cpp :lc-problem 329
class Solution {
public:
    int longestIncreasingPath(vector<vector<int>>& matrix) {
        
    }
};
#+end_src