Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· two-pointers Mock interview

3Sum

Given an integer array `nums`, return all unique triplets [a, b, c] with a <= b <= c that sum to 0. Return the list of triplets sorted for a deterministic result.

Examples

in: nums = [-1,0,1,2,-1,-4]

out: [[-1,-1,2],[-1,0,1]]

the two unique zero-sum triplets

Constraints

0 <= len(nums) <= 3000
-10^5 <= nums[i] <= 10^5

Hints

target: O(n^2) time⌘↩ run · ⇧⌘↩ submit