Status: IN
The min-cost-climbing-stairs solution demonstrates the general DP-to-streaming reduction: an O(n) DP table with bounded lookback (each cell depends on only the previous two) collapses to O(1) rolling variables while preserving the recurrence's loop invariant, with the final answer requiring a min over the last two states because the top is reachable from either.
Three structural properties of min-cost-climbing-stairs jointly demonstrate the bounded-lookback DP-to-streaming reduction pattern
Depends on (SL): min-cost-dp-uses-constant-space, min-cost-loop-invariant, min-cost-final-answer-is-min-of-last-two