{"id":"valid-parentheses-single-pass-stack","text":"`is_valid` uses a single-pass stack-based approach with O(n) time and O(n) worst-case space; it short-circuits on the first mismatch.","truth_value":"IN","source":"entries/2026/06/06/valid-parentheses-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"valid-parentheses-single-pass-stack","truth_value":"IN","reason":"premise"}]}}