You are given an integer array and a positive integer K. You have to tell if there exists a pair of integers in the given array such that ar[i]-ar[j]=K 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;
}