{"id":"merge-nums-two-pointer-linear-time","text":"`merge_nums` uses a two-pointer merge pattern, visiting each element exactly once for O(n + m) time complexity — exploiting the sorted precondition rather than using a hash map.","truth_value":"IN","source":"entries/2026/06/06/merge-two-2d-arrays-by-summing-values-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-nums-two-pointer-linear-time","truth_value":"IN","reason":"premise"}]}}