Longest Increasing Path in a Matrix at DoorDash

Problem Description

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

Topics

Also asked at 13 companies