{"id":"merge-alternately-linear-complexity","text":"`mergeAlternately` runs in O(n + m) time and space via a single pass with list accumulation and join.","truth_value":"IN","source":"entries/2026/06/06/merge-strings-alternately-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["merge-paradigm-linear-via-pointer-advancement","merge-scan-pattern-for-sorted-pair-processing"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"merge-alternately-linear-complexity","truth_value":"IN","reason":"premise"}]}}