{"id":"min-cost-dp-uses-constant-space","text":"`minCostClimbingStairs` uses O(1) auxiliary space via two rolling variables (`prev1`, `prev2`) instead of an O(n) DP array.","truth_value":"IN","source":"entries/2026/06/06/min-cost-climbing-stairs-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["dp-rolling-reduction-correct-unless-degenerate-input","dp-to-streaming-via-rolling-variable-reduction"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"min-cost-dp-uses-constant-space","truth_value":"IN","reason":"premise"}]}}