**Problem Description**

Given an one-dimensional unsorted array **A** containing **N** integers.

You are also given an integer **B**, find if there exists a pair of elements in the array whose difference is **B**.

Return **1** if any such pair exists else return **0**.

- 1 <= N <= 10
^{5} - -10
^{3}<= A[i] <= 10^{3} - -10
^{5}<= B <= 10^{5}

First argument is an integer array **A** of size **N**.

Second argument is an integer **B**.

Return **1** if any such pair exists else return **0**.

Input 1:

A = [5, 10, 3, 2, 50, 80] B = 78

Input 2:

A = [-10, 20] B = 30

Output 1:

1

Output 2:

1

Explanation 1:

Pair (80, 2) gives a difference of 78.

Explanation 2:

Pair (20, -10) gives a difference of 30 i.e 20 - (-10) => 20 + 10 => 30

NOTE:You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.

Loading...