Skip to content

problem3.md

Latest commit

 

History

History
12 lines (9 loc) · 439 Bytes

problem3.md

File metadata and controls

12 lines (9 loc) · 439 Bytes

Problem 3: Triplet Nullification (3Sum)

Problem Statement

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.

Input Format

  • An array of integers nums.

Example

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