Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Given an array **arr[] **of **n** integers. Check whether it contains a triplet that sums up to zero.

**Example 1:**

**Input**: n = 5, arr[] = {0, -1, 2, -3, 1}
**Output**: 1
**Explanation**: 0, -1 and 1 forms a triplet
with sum equal to 0.

**Example 2:**

**Input**: n = 3, arr[] = {1, 2, 3}
**Output**: 0
**Explanation**: No triplet with zero sum exists.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the boolean function **findTriplets()** which takes the array arr[] and the size of the array (n) as inputs and print 1 if the function returns true else print 0 if the function returns false.

**Expected Time Complexity: **O(n^{2})

**Expected Auxiliary Space: **O(1)

**Constrains:**

1 <= n <= 10^{4}

-10^{6} <= A_{i} <= 10^{6}

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Find triplets with zero sum

...