{"id":"min-cost-loop-invariant","text":"After processing index `i`, `prev1` holds the minimum cost to reach and pay step `i`, and `prev2` holds the same for step `i-1`.","truth_value":"IN","source":"entries/2026/06/06/min-cost-climbing-stairs-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["dp-to-streaming-via-rolling-variable-reduction"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"min-cost-loop-invariant","truth_value":"IN","reason":"premise"}]}}