3Sum

Find all unique triplets in the array which gives the sum of zero.

Problem Description

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]]

 

Constraints:

  • 3 <= nums.length <= 3000
  • -105 <= nums[i] <= 105
Solution
Write your code here. (Editor is for demonstration)
function threeSum(nums) {
  // Write your code here
};