Longest Increasing Path in a Matrix

Given an `m x n` integers `matrix`, return the length of the longest strictly 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). ### Constraints - `m == matrix.length` - `n == matrix[i].length` - `1 <= m, n <= 200` - `0 <= matrix[i][j] <= 2^31 - 1` ### Input Format Each line represents a row of the matrix containing space-separated integers. ### Output Format Print the length of the longest strictly increasing path.