Skip to main content

3Sum

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.

Problems6 / 152
Sign in

3Sum

MEDIUMArrayTwo Pointers

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.

Example 1

Input:  nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]

Example 2

Input:  nums = [0,1,1]
Output: []
Show hint

Sort the array first. Use one pointer fixed, then use two pointers technique for the remaining two numbers.

Draft saves automatically

Loading editor...

Submit also runs hidden tests
nums =
[-1,0,1,2,-1,-4]
Expected
[[-1,-1,2],[-1,0,1]]
Run with your own input (JSON)