mediumTwo Pointers Pattern

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.

Examples

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

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

Explanation: The distinct triplets that sum to zero.

Input:nums = [0,1,1]

Output:[]

Explanation: The only possible triplet does not sum to zero.

Hints (0/3)

Try to solve it first! Click "Reveal Next Hint" if you get stuck.

Your Code:

Results:

Output

Click "Run" to execute your code