Given an array of integers, find the number of distinct pairs of a,b,c which some to 0. Some notes, the pairs should be distinct the pairs should be such that a<=b<=c code example
Example: two elements with difference K in c++
bool diffK(int A[], int N, int K) {
sort(A, A+N);
int i = 0, j = 0;
while (i < N && j < N) {
if (A[i] == A[j] + K) return true;
else if (A[i] < A[j] + K) i++;
else j++;
}
return false;
}