first-match-is-minimum-in-sorted-scan

Status: IN

In the two-pointer scan of two sorted arrays, the first equality found is necessarily the smallest common value because both pointers start at index 0 and only advance forward.

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

JSON