ConceptTheory & Algos
Dynamic programming with Implicit graphs
Solving a graph problem using recursion and memoization or iteration over a grid without explicitly building the graph structure in memory.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.