Coding: Three Sum | Dataford Interview Questions

Spotify playlist analysis may need to identify three track scores whose combined adjustment is neutral. Given an integer array nums, return every unique triplet [a, b, c] such that a + b + c == 0.

Formal Specification

Implement three_sum(nums). The input is a list of integers. Return a list of triplets, where each triplet contains values from three different array positions and is sorted in nondecreasing order. The result must not contain duplicate triplets, and the ordering of triplets may be arbitrary.

You may modify nums in place while solving the problem.

Constraints

3 <= nums.length <= 3 * 10^3
-10^5 <= nums[i] <= 10^5
Each array position can be used at most once per triplet
Duplicate triplets must appear only once

Function Signature

def three_sum(nums):

Your question is Coding: Three Sum. 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