FastPrep
Problem · Array

3Sum

Learn this problem
● MediumAgodaONSITE INTERVIEW

Problem statement

Given an integer array nums, return every unique triplet [a, b, c] whose values sum to 0.

Output Rules

  • Sort each triplet in ascending order.
  • Sort the list of triplets lexicographically.
  • Do not return duplicate triplets.

Function

threeSum(nums: int[]) → int[][]

Examples

Example 1

nums = [-1,0,1,2,-1,-4]return = [[-1,-1,2],[-1,0,1]]

Example 2

nums = [0,0,0,0]return = [[0,0,0]]

The same value triplet is returned only once.

More Agoda problems

drafts saved locally
public int[][] threeSum(int[] nums) {
  // write your code here
}
nums[-1,0,1,2,-1,-4]
expected[[-1,-1,2],[-1,0,1]]
checking account