Tap here to switch tabs
Problem
Submissions

Problem: 3Sum

3Sum asks you to find every unique triplet in an integer array whose three values add up to zero, using distinct indices and excluding duplicate triplets regardless of order.

Statement

Given an integer array nums, find all unique triplets [nums[i], nums[j], nums[k]] where i, j, and k are distinct indices, such that the three elements sum to zero.

The result must not contain any duplicate triplets. The order of the output and the order of elements within each triplet does not matter.

Note: The solution set must only include unique triplets. Two triplets are considered duplicates if they contain the same elements regardless of ordering.

Constraints:

  • 3≤3 \leq nums.length ≤3000\leq 3000

  • −105≤-10^5 \leq nums[i] ≤105\leq 10^5

⋮
Tap here to switch tabs
Problem
Submissions

Problem: 3Sum

3Sum asks you to find every unique triplet in an integer array whose three values add up to zero, using distinct indices and excluding duplicate triplets regardless of order.

Statement

Given an integer array nums, find all unique triplets [nums[i], nums[j], nums[k]] where i, j, and k are distinct indices, such that the three elements sum to zero.

The result must not contain any duplicate triplets. The order of the output and the order of elements within each triplet does not matter.

Note: The solution set must only include unique triplets. Two triplets are considered duplicates if they contain the same elements regardless of ordering.

Constraints:

  • 3≤3 \leq nums.length ≤3000\leq 3000

  • −105≤-10^5 \leq nums[i] ≤105\leq 10^5