LeetCode
Question
#329 Longest Increasing Path in a Matrix
Question Details
LeetCode #329: Longest Increasing Path in a Matrix. Difficulty: Hard. Topics: Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix. Asked at DoorDash in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Breadth-First Search
Depth-First Search
Graph Theory
Memoization
Topological Sort
Arrays
Dynamic Programming
Graph
Matrix
More from DoorDash
Reddit
DoorDash Gets Rid Of LeetCode Interviews In Favor Of AI Technical Interview
Reddit
DoorDash Analytics Engineer Technical Interview
Reddit
Doordash phone screen yay or nay ?
1p3a
DoorDash Senior Engineer Interview: Code Craft and System Design
1p3a
Doordash Software Engineer Onsite Interview Experience and Insights