{"id":"two-pointer-merge-scan-for-sorted-intersection","text":"`min_common_number` uses the two-pointer merge-scan pattern: advance the pointer on the smaller value, return on equality — the canonical O(n+m) time, O(1) space approach for finding common elements in two sorted arrays.","truth_value":"IN","source":"entries/2026/06/06/minimum-common-value-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["merge-scan-pattern-for-sorted-pair-processing"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"two-pointer-merge-scan-for-sorted-intersection","truth_value":"IN","reason":"premise"}]}}