dsa · medium
3Sum
GreyOrangeArrayTwo Pointers
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, j != k, and nums[i] + nums[j] + nums[k] == 0. The solution set must not contain duplicate triplets. Return triplets as a list of lists.
Arguments
nums— the input array of integers
**Example 1:** `` Input: nums = [-1,0,1,2,-1,-4] Output: [[-1,-1,2],[-1,0,1]] ``
Constraints
0 <= nums.length <= 3000 Hidden tests include near-max size for this bound; a slower-than-intended solution TLEs.
Examples
Example 1
Input: [-1,0,1,2,-1,-4] Expected: [[-1,-1,2],[-1,0,1]]
Example 2
Input: [0,1,1] Expected: []