Problem Brief

Find Number of Perfect Pairs

Given an array, find the number of perfec pairs.

(x, y) is a perfect pair if satisfies:

min(|x-y|, |x+y|) <= min (|x|, |y|) and max(|x-y|, |x+y|) > max(|x|, |y|)

1Example 1

Input

arr = [2, 5, -3]

Output

Explanation

out of (2, 5) , (5, -3) and (2, -3), (2, -3) and (5, -3) satisfy both the conditions. Therefore, the output is 2.

Draft autosaves locally

public int findNumberOfPerfectPairs(int[] arr) {
  // write your code here
}

Input

arr

[2, 5, -3]

Output