3Sum · Coding Interview Practice

3SumGiven an integer array, return all unique triplets that sum to zero.Constraints

3 <= nums.length <= 3000

-10^5 <= nums[i] <= 10^5

The solution set must not contain duplicate triplets

Examples

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

Input: nums = [0,1,1] Output: []

LetsDiscuss

Loading your session…