18. 3Sum
mediumAsked at YelpFind all unique triplets in an array that sum to zero — Yelp uses sort + two-pointer to test whether candidates can dedupe and scale before tackling geo-clustered triplet matching.
By Alex Chen, Founder, InterviewChamp.AI · Last verified
Problem
Given an integer array nums, return all unique triplets [a,b,c] such that a + b + c = 0. The solution set must not contain duplicate triplets.
Constraints
3 <= nums.length <= 3000-10^5 <= nums[i] <= 10^5
Examples
Example 1
nums = [-1,0,1,2,-1,-4][[-1,-1,2],[-1,0,1]]Example 2
nums = [0,1,1][]Approaches
1. Brute force
Try every triplet and dedupe via sorted-string set.
- Time
- O(n^3)
- Space
- O(n)
const set = new Set();
for (let i = 0; i < nums.length; i++)
for (let j = i+1; j < nums.length; j++)
for (let k = j+1; k < nums.length; k++)
if (nums[i]+nums[j]+nums[k] === 0) set.add([nums[i],nums[j],nums[k]].sort().join(','));
return [...set].map(s => s.split(',').map(Number));Tradeoff:
2. Sort + two pointers
Sort, fix one element, then two-pointer the remainder for the complement, skipping duplicates as you go.
- Time
- O(n^2)
- Space
- O(1)
function threeSum(nums) {
nums.sort((a, b) => a - b);
const out = [];
for (let i = 0; i < nums.length - 2; i++) {
if (i > 0 && nums[i] === nums[i-1]) continue;
let l = i+1, r = nums.length - 1;
while (l < r) {
const s = nums[i] + nums[l] + nums[r];
if (s === 0) {
out.push([nums[i], nums[l], nums[r]]);
while (l < r && nums[l] === nums[l+1]) l++;
while (l < r && nums[r] === nums[r-1]) r--;
l++; r--;
} else if (s < 0) l++;
else r--;
}
}
return out;
}Tradeoff:
Yelp-specific tips
Yelp will pivot this to geo indexing — be ready to discuss how triplet-matching with sorted scans extends to finding three nearby businesses whose review-score gradients balance to zero in a recommendation model.
Solve it now
Free. No sign-up. Python and JavaScript run instantly in your browser.
Practice these live with InterviewChamp.AI
Drill 3Sum and other Yelp interview questions under real-loop conditions with instant feedback on your reasoning, complexity claims, and code.
Practice these live with InterviewChamp.AI →