# Positive Negative Pair

Posted: 18 Dec, 2020
Difficulty: Easy

## PROBLEM STATEMENT

#### Given an array of distinct integers, find all the pairs having positive value and negative value of a number that exists in the array. Return the pairs in any order.

##### Note:
``````The pair consists of equal absolute values, one being positive and another negative.

Return an empty array, if no such pair exists.
``````
##### Input Format:
``````The first line of input contains an integer ‘T’ denoting the number of test cases.

The next ‘2T’ lines represent the ‘T’ test cases.

The first line of each test case contains an integer ‘N’ denoting the number of integers in the array.

The second line of each test case contains ‘N’ space-separated integers which denote the elements of the array.
``````
##### Output Format:
``````For each test case, print all pairs with equal absolute value with one being positive and another negative.
``````
##### Note:
``````You do not need to print anything, it has already been taken care of. Just implement the given function.
``````
##### Constraints:
``````1 <= T <= 50
1 <= N <= 10^4
-10^5 <= A[i] <= 10^5

Time Limit: 1 second
`````` Approach 1
• We use two nested loops to find the solution.
• We make a vector to store positive and negative pairs.
• For each element arr[i], find the corresponding negative of arr[i] from index ‘i + 1’ to ‘n – 1’ and store it in another array.