Two Pointers
LC #15Medium
3Sum
Two Pointers
AmazonGoogleMetaAppleMicrosoftProblem
Find all unique triplets in an array that sum to zero.
arraytwo-pointerssorting
Constraints
- ›3 ≤ n ≤ 3000
- ›-10⁵ ≤ nums[i] ≤ 10⁵
- ›Output must not contain duplicate triplets
Example
Input
nums = [-1, 0, 1, 2, -1, -4]Output
[[-1, -1, 2], [-1, 0, 1]]Why
Two unique triplets sum to zero; duplicates must be excluded