{"id":"stack-queue-front-invariant","text":"After every push, the front of the internal deque is the most recently pushed element (stack top), maintained by dequeuing and re-enqueuing n-1 preceding elements.","truth_value":"IN","source":"entries/2026/06/06/implement-stack-using-queues-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"stack-queue-front-invariant","truth_value":"IN","reason":"premise"}]}}