Zero Pair Sum

Posted: 22 Jul, 2021
Difficulty: Moderate

PROBLEM STATEMENT

Try Problem

You are given an array ‘arr’ of ‘N’ integers. Your task is to find the count of pairs with a sum equal to zero.

Specifically, find the count of all pairs ( i , j ) such that i < j and arr[i] + arr[j] = 0

 

Input Format :
The first line contains a single integer ‘T’ denoting the number of test cases, then each test case follows

The first line of each test case contains a single integers ‘N’ denoting the length of the array.

The second line of each test case contains ‘N’ integers denoting the array elements.
Output Format :
For each test case print a single integer denoting the count of pairs with zero-sum.
Note :
You are not required to print anything; it has already been taken care of. Just implement the function.
Constraints :
1 <= T <= 10      
1 <= N <= 10^4
10^-9 <= arr[i] <= 10^9

Time limit: 1 sec
Approach 1

 

We can generate all pairs possible and check whether their sum is equal to zero.

To generate all the pairs: for each x in the range [0, N-2] iterate through all y in the range [x+1, N-1].
 

The steps are as follows :

  1. Initialize count to 0.
  2. Run outer for loop for x from 0 to N-2
  3. Run inner for loop for y from x+1 to N-1
  4. For each generated pair of (x,y) increment the count if the arr[x]+arr[y] =0
  5. Return the final value of count.
Try Problem