3Sum
Problem statement
Given an integer array nums, return all triplets [nums[i], nums[j], nums[k]] such that i, j and k are three different indices and nums[i] + nums[j] + nums[k] == 0.
The problem statement continues
ProExamples
Example 1
nums = [-1,0,1,2,-1,-4]return = [[-1,-1,2],[-1,0,1]]-1 + 0 + 1 = 0and-1 + (-1) + 2 = 0.- The triplet
[-1, 0, 1]can be formed with either -1, but it is listed once. Each triplet is written in non-decreasing order, and[-1, -1, 2]comes before[-1, 0, 1].
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week