DoorDash SDE Interview Question 2023 March | Graphs & DFS Memoization | On-campus

Question 1: Longest Increasing Path in a Matrix Problem Statement Given an m x n integers matrix, return the length of the longest increasing path in the 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). The path must be strictly mathematically increasing. Constraints m == matrix.length n == matrix[i].length 1 <= m, n <= 200 0 <= ...