-
Notifications
You must be signed in to change notification settings - Fork 0
/
question_02.cpp
61 lines (37 loc) · 1.12 KB
/
question_02.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/*
==> Find triplets with zero sum <==
Question Link:- https://practice.geeksforgeeks.org/problems/find-triplets-with-zero-sum/1?page=1&difficulty[]=-1&category[]=Arrays&sortBy=submissions
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.
*/
#include <iostream>
#include <algorithm>
using namespace std;
bool findTriplets(int arr[], int n) {
sort( arr, arr + n );
for ( int i = 0; i < n; i++ ) {
int s = 0, e = n - 1;
while (s < e) {
if ( i == s ) s++;
if ( i == e ) e--;
int sum = arr[i] + arr[s] + arr[e];
if ( sum == 0 ) return true;
if ( sum < 0 ) s++;
if ( sum > 0 ) e--;
}
}
return false;
}
int main () {
int arr[] = { 1, 2, 3 };
cout << findTriplets(arr, 3);
return 0;
}