← Microsoft questions

Find pair with target sum in array

Filed under Microsoft · Also reported at Fastenal

Given an array of integers and a target sum, determine whether there exists a pair of numbers in the array whose sum equals the target, optimizing time complexity using additional memory.

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.