Leetcode 2540. Minimum Common Value

Given two non-decreasing integer arrays, return the smallest integer that appears in both arrays (or -1 if no common element exists). Because the arrays are sorted, the smallest common value can be found by a coordinated linear scan (two-pointer) in O(n) time.