Problem

Submissions

Hints & solutions

Discuss

Find All Triplets With Zero Sum

Moderate

0/80

Average time to solve is 30m

Contributed by

77 upvotes

Asked in companies

Problem statement

You are given an array Arr consisting of n integers, you need to find all the distinct triplets present in the array which adds up to zero.

An array is said to have a triplet {arr[i], arr[j], arr[k]} with 0 sum if there exists three indices i, j and k such that i!=j, j!=k and i!=k and arr[i] + arr[j] + arr[k] = 0.

Note :

1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then (2, -3, 1), (-3, 2, 1) etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".

Detailed explanation ( Input/output format, Notes, Images )

Input Format :

The first line of the input contains an integer T, denoting the number of test cases.
The first line of each test case contains the integer N, denoting the size of the array.
The second line of each test case contains N space-separated integers denoting the array elements.

Output Format :

For each test case, every line of output contains three spaced integers that correspond to the elements which add to zero. Refer to sample input 2 for more clarification.

Note :

You do not need to print anything, it has already been taken care of. Just implement the given function.

Constraints :

1 <= T <=  50
1 <= N <= 10^3  
-10^5 <= Arr[i] <= 10^5
Time Limit: 1 sec

Sample Input 1 :

 1
 5
-10 5 5 -5 2
 0

Sample Output 1 :

-10 5 5

Explanation for Sample Input 1 :

-10 5 5 is the only triplet that adds up to zero. Note that the order of output does not matter, so 5 -10 5 or 5 5 -10 are also acceptable.

Sample Input 2 :

3
6
1 2 3 -1 -2 -3
0
4
1 2 3 4 
1
6
-1 -1 2 2 -1 -1
0

Sample Output 2 :

1 2 -3
-1 -2 3
-1
-1 -1 2

Explanation for Sample Input 2 :

For the first input (1, 2, -3) and (-1, -2, 3) are the only triplets that add to zero.
In the second input, since there are no such triplets, we print -1.
For the third input, the only distinct triplet is (-1, -1, 2), so just print -1 -1 2.

Hint 1

Hint 2

Try all possible combinations.

Approaches (2)

Approach 1

Approach 2

Brute Force

The most trivial approach would be to find all triplets of the array and count all such triplets whose sum = 0.
We can find the answer using three nested loops for three different indexes and check if the sum of values at those indexes adds up to zero.
Create a set to keep the track of triplets we have visited. Run first loop from i = 0 to i = n - 3, second loop from j = i + 1 to j = n - 2 and third loop from k = j + 1 to k = n - 1.
Check if arr[i] + arr[j] + arr[k] = 0
- If the triplet is not present in the set, then print the triplet and insert triplet into the set since we need distinct triplets only.
- Else continue.

Time Complexity

O(N^3), where N is the number of elements in the array.

Space Complexity

O(N), where N is the number of elements in the array.

Since we are using visited set to keep track of visited triplets and in the worst case there will be N/3 different triplets. So space taken by visited will be N/3. Thus, overall space complexity will be O(N).

(100% EXP penalty)

Find All Triplets With Zero Sum

Console