New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Three Sum

Contributed by

imObscure

Medium

0/80

20 mins

80 %

34 upvotes

Problem Statement

You are given an array ‘ARR’ containing ‘N’ integers.

Return all the unique triplets [ARR[i], ARR[j], ARR[k]] such that i != j, j != k and k != i and their sum is equal to zero.

Example:

Input: ‘N’ = 5 
'ARR' =  [-1, -1, 2, 0, 1] 

Output: 
-1 -1 2
-1 0 1

Explanation:
(-1 -1 +2) = (-1 +0 +1) = 0.

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

Input Format:

The first line contains an integer, ‘N’, representing the number of elements in the array.

The next line contains ‘N’ space-separated integers representing the elements of the array.

Output format:

Return an integer, the number of all the unique triplets with zero-sum.

Sample Input 1:

5 
-1 -1 2 0 1

Sample Output 1 :

-1 -1 2
-1 0 1

Explanation Of Sample Input 1:

(-1 -1 +2) = (-1 +0 +1) = 0.

Sample Input 2:

4 
0 0 0 0

Sample Output 2 :

0 0 0

Constraints:

1  <= N <= 1000
1 <= ARR[i] <= 1000
Time Limit: 1 sec

Autocomplete

Console