hard20 pts · first answer countsdynamic-programminggrid-dpmemoization
Longest increasing path in a matrix
You find the longest strictly increasing path in a grid, moving in 4 directions, using DFS with a memo per cell. Why is no visited set needed?
Discussion 0
Join free to post in the discussion.
Related questions
- Signs that a problem suits DPBackend Developer
- What memoisation meansBackend Developer
- What tabulation meansBackend Developer
- Cost of plain recursive FibonacciBackend Developer
- Fibonacci after adding a cacheBackend Developer
- Recursion with no base caseBackend Developer
- Ways to climb five stairsBackend Developer
- Hidden memory cost of recursionBackend Developer