Three Sum Unique Triplets | Dataford Interview Questions

Design an efficient algorithm to find all unique triplets in an array that sum up to zero.

Implement three_sum(nums) to return every triplet as an ascending list, with no duplicate triplets; the overall result may be returned in any order. For example, [-1, 0, 1, 2, -1, -4] returns [[-1, -1, 2], [-1, 0, 1]], while [0, 0, 0, 0] returns [[0, 0, 0]].

Constraints

0 <= nums.length <= 3000
-10^5 <= nums[i] <= 10^5
Each returned triplet must be sorted in ascending order
The result must not contain duplicate triplets

Function Signature

def three_sum(nums):

Your question is Three Sum Unique Triplets. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Design an efficient algorithm to find all unique triplets in an array that sum up to zero.

Constraints

0 <= nums.length <= 3000
-10^5 <= nums[i] <= 10^5
Each returned triplet must be sorted in ascending order
The result must not contain duplicate triplets

Function Signature

def three_sum(nums):

Your question is Three Sum Unique Triplets. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.