← Goldman Sachs questions
CodingReported in a candidate post, Feb 2022

Find a triplet that sums to a given value

Filed under Goldman Sachs · Also reported at Cisco, Infoedge, OYO, Pluang, Snapdeal

Given an array of integers nums and an integer target, find all unique triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == target (or sum to…

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.