{"id":"final-prices-monotone-stack-linear-time","text":"`finalPrices` achieves O(n) time via a monotone stack where each index is pushed and popped at most once.","truth_value":"IN","source":"entries/2026/06/06/final-prices-with-a-special-discount-in-a-shop-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"final-prices-monotone-stack-linear-time","truth_value":"IN","reason":"premise"}]}}