Quiz: DFS with Memoization

In Longest Increasing Path, calling DFS from every cell seems expensive. What technique avoids recomputing paths from the same cell?

1. A.Caching the longest path starting from each cell
2. B.Using BFS instead of DFS
3. C.Only starting DFS from corner cells
4. D.Sorting cells by value first