Close
Topic list
Three Sum
MEDIUM
20 mins
Other topics
Problem solved
Skill meter
Strings
-
-
Matrices (2D Arrays)
-
-
-
-
Sorting
-
-
Binary Search
-
-
Stacks & Queues
-
-
Trees
-
-
Graph
-
-
Dynamic Programming
-
-
Greedy
-
-
Tries
-
-
Arrays
-
-
SQL
-
-
Binary Search Trees
-
-
Heap
-
-
Bit Manipulation
-
-
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.

# Three Sum

Contributed by
imObscure
Medium
0/80
Avg time to solve 20 mins
Success Rate 80 %
Share

## Problem Statement

#### 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, Constraints, Images )
##### 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
``````
Auto
Console