Find Unique Triplets That Sum to Zero

MediumPython

Problem

Given an integer array nums, return all the unique triplets [nums[i], nums[j], nums[k]] such that i, j, and k are distinct indices and nums[i] + nums[j] + nums[k] == 0.

The solution must avoid duplicate triplets in the output.

Constraints

0 <= nums.length <= 3000
-10^5 <= nums[i] <= 10^5

Function Signature

def three_sum(nums):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.