Implement a LeetCode-Style Algorithm

MediumPython

Problem

Implement an algorithm to solve a classic LeetCode-style problem.

Implement three_sum(nums) to return every unique triplet whose values sum to zero. Return triplets in nondecreasing order, with the collection ordered consistently; the input may contain duplicates.

Input is a list of integers, and output is a list of integer triplets. Do not reuse an array element within one triplet.

Constraints

3 <= nums.length <= 300
-10^5 <= nums[i] <= 10^5
Each output triplet must be sorted in nondecreasing order
The output must not contain duplicate triplets

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.