# Pair Difference K

Posted: 11 Jan, 2021

Difficulty: Moderate

#### You are given a sorted array ARR of integers of size N and an integer K. You have to find whether it is possible to find a pair of integers having an absolute difference of K.

#### Note:

```
1. K is a non-negative integer.
2. Absolute Difference between two integers A and B is equal to the difference of maximumOf(A, B) and minimumOf(A, B).
3. Pair of integers should have different indices in the array.
```

##### Input format:

```
The first line of input contains an integer T, denoting the number of test cases.
The first line of each test case consists of two space-separated integers N and K, denoting the size of the given array ARR and the required absolute difference.
The second line of each test case consists of N space-separated integers denoting the elements of the array.
```

##### Output format:

```
For each test case print, “Yes” if it is possible to have a pair of integers having absolute difference equal to K and “No” otherwise, in a separate line.
```

##### Note:

```
You don't have to print anything, it has already been taken care of. Just Implement the given function.
```

##### Constraints:

```
1 <= T <= 100
1 <= N <= 10^4
1 <= ARR[i] <= 10^9
0 <= K <= 10^9
Time Limit: 1 sec.
```

SIMILAR PROBLEMS

Best time to buy and sell stock

Posted: 2 Sep, 2022

Difficulty: Moderate

Best time to buy and sell stock II

Posted: 5 Sep, 2022

Difficulty: Moderate

LRU Cache

Posted: 10 Sep, 2022

Difficulty: Moderate

Array Rotation

Posted: 21 Oct, 2022

Difficulty: Easy

Find The Single Element

Posted: 30 Oct, 2022

Difficulty: Easy