Grid, lattice, substring, and state-machine dynamic programming
These visualizers spread DP across grids, windows, and layered state machines so you can watch information flow spatially instead of only along a line.
Watch profit flow through a four-stage trading control room where each day can upgrade the first buy, first sell, second buy, or second sell state.
DP state machine / at most two transactions / profit optimization
Scale the trading ladder to k transactions and watch each price update a full stack of buy and sell layers.
DP state machine / k transactions / layered optimization
Step through an edit laboratory where insert, delete, and replace compete cell by cell inside the transformation matrix.
2D DP / string transformation / operation cost matrix
Use a weave loom to track whether prefixes of two source strings can interlace cleanly into the target ribbon.
2D DP / string weave / prefix compatibility
Scan a resonance table of substring windows and watch mirrored endpoints light up the longest valid palindrome in the string.
2D DP / substring windows / palindrome table
Use a square radar to grow all-ones squares from every valid cell and watch the largest area emerge from the DP field.
2D DP / square growth / binary matrix
Traverse a luminous atlas where every cell chooses the cheaper path from above or left until the destination cost stabilizes.
2D DP / grid path cost / right and down transitions
Descend through a crystal lattice where each cell inherits the cheaper of its two parents above and the minimum path reveals itself in the bottom row.
2D DP / triangular grid / minimum path sum
Watch path counts flow around obstacles as the robot's reachable field expands through the grid one open cell at a time.
2D DP / obstacle grid / path counting