Three numbers summing to zero
Mediumarraytwo pointerssorting
Return every distinct triplet of elements (at different positions) that sums to zero, with no repeated triplets. Order doesn't matter, inside a triplet or between them.
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: []
Example 3
Input: nums = [0,0,0] Output: [[0,0,0]]
Constraints
- 0 ≤ nums.length ≤ 3000
- -10⁵ ≤ nums[i] ≤ 10⁵
Submit checks your solution against 9 tests, including hidden ones.
/**
* @param {int[]} nums
* @return {int[][]}
*/
function threeSum(nums) {
}