You are given an integer array nums.

A pair of indices $(i, j)$ is considered a perfect pair if $0 \leq i < j <$ nums.length and the following two conditions are satisfied for $a = $ nums[i] and $b = $ `nums[j]$:

1. $\min(|a - b|, |a + b|) \leq \min(|a|, |b|)$

2. $\max(|a - b|, |a + b|) \geq \max(|a|, |b|)$

Return the total number of perfect pairs in nums.

Constraints:

• $2 \leq$ nums.length $\leq 10^5$

• $-10^9 \leq$ nums[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.