โ† Goldman Sachs questions

Pairs with Given Sum in Sorted Arrays

Filed under Goldman Sachs

Given two sorted arrays of integers and a target sum, find all pairs (one element from each array) whose sum equals the target. Achieve O(n) time complexity.

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 Goldman Sachs questions

Collected from public candidate posts and coding forums. Updated Nov 2026.