Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2540. Minimum Common Value
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source