Answers for "given an unsorted array of integers and an integer k. find the number of all possible unordered pairs of integers whose difference is equals to k."

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;
}

Posted by: Guest on July-01-2020

Code answers related to "given an unsorted array of integers and an integer k. find the number of all possible unordered pairs of integers whose difference is equals to k."

Code answers related to "C++"

Browse Popular Code Answers by Language

Answers for "given an unsorted array of integers and an integer k. find the number of all possible unordered pairs of integers whose difference is equals to k."

Code answers related to "given an unsorted array of integers and an integer k. find the number of all possible unordered pairs of integers whose difference is equals to k."

Code answers related to "C++"

Browse Popular Code Answers by Language

Answers for "given an unsorted array of integers and an integer k. find the number of all possible unordered pairs of integers whose difference is equals to k."

Code answers related to "given an unsorted array of integers and an integer k. find the number of all possible unordered pairs of integers whose difference is equals to k."

Code answers related to "C++"

Browse Popular Code Answers by Language

Popular Programming Languages

Advertisements

Company

Compilers

Help

Connect with us