← Microsoft questionsThree Closest Elements from Sorted Arrays
Filed under Microsoft
Given three sorted arrays, find one element from each (a, b, c) such that the value |max(a, b, c) - min(a, b, c)| is minimized.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.
Related Microsoft questions
Collected from public candidate posts and coding forums. Updated Nov 2026.