two-pointer-merge-scan-for-sorted-intersection

Status: IN

`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.

Source: entries/2026/06/06/minimum-common-value-solution.md

Depended on by

JSON