Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.