← Microsoft questions

Pair Sum in Sorted Array

Filed under Microsoft · Also reported at JPMorgan Chase, PayU

Given a sorted array of integers `nums` and a target value `target`, find a pair of elements `(a, b)` whose sum is closest to `target`. If multiple pairs have the same closest difference, return any…

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.