#15 3Sum

Medium Acceptance 0%

description

Problem Description

Given an integer array nums, return all the triplets `[nums[i], nums[j], nums[k]]` such that `i != j`, `i != k`, and `j != k`, and `nums[i] + nums[j] + nums[k] == 0`. Notice that the solution set must not contain duplicate triplets.

checklist Constraints

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

science Examples

Case #1

In: nums = [-1,0,1,2,-1,-4]

Out: [[-1,-1,2],[-1,0,1]]

Case #2

In: nums = [0,1,1]

Out: []

Mastery Tags

Arrays Sorting Two Pointers

Hiring Companies

Amazon Google Meta

code