Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.

Note:

```
We cannot use the element at a given index twice.
```

Follow Up:

```
Try to do this problem in O(N) time complexity.
```

Detailed explanation

```
1 ≤ n ≤ 105
1 ≤ arr[i] ≤ 105
Where 'T' denotes the number of test cases, 'N' represents the size of the array, 'TARGET' represents the sum required, and 'ARR[i]' represents array elements.
Time Limit: 1 sec.
```

```
2
4 9
2 7 11 13
5 1
1 -1 -1 2 2
```

```
2 7
-1 2
-1 2
```

```
For the first test case, we can see that the sum of 2 and 7 is equal to 9 and it is the only valid pair.
For the second test case, there are two valid pairs (-1,2) and (-1,2), which add up to 1.
```

```
1
4 16
2 7 11 13
```

```
-1 -1
```