← Goldman Sachs questions

Grid Path String Generation and Closest Pair Sum

Filed under Goldman Sachs

Part 1: Given a grid of characters, find the path to spell a word using U, D, L, R moves. Part 2: Given a sorted array, find two numbers whose sum is closest to a target value.

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.