top of page

### Looking to master object-oriented and system design for tech interviews or career growth?

• Improve your system design and machine coding skills.

• Study with our helpful resources.

**We're in beta mode and would love to hear your feedback.

Search

# Pair With Given Difference - InterviewBit Solution

### Problem Description

Given a 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.

Problem Constraints

• 1 <= N <= 1e5

• -1e3 <= A[i] <= 1e3

• -1e5 <= B <= 1e5

Input Format

The first argument is an integer array A of size N. The second argument is an integer B.

Output Format

Return 1 if any such pair exists else return 0.

Example Input

```Input 1:
A = [5, 10, 3, 2, 50, 80]  B = 78

Input 2:
A = [-10, 20]  B = 30 ```

Example Output

```Output 1:
1

Output 2:
1 ```

Example Explanation

```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 ```

### Solution:

Code in C++

If you have any questions or queries, feel free to drop a comment in the comments section below.