3649. Number of Perfect Pairs

LeetCodeArrayMathTwo PointersSortingOpen on judge ↗

You are given an integer array nums. A pair of indices (i, j) is called perfect if the following conditions are satisfied: - i < j - Let a = nums[i], b = nums[j]. Then: - min(|a - b|, |a + b|) <= min(|a|, |b|) - max(|a - b|, |a + b|) >= max(|a|, |b|) Return the number of distinct perfect pairs. Note: The absolute value |x| refers to the non-negative value of x. Example 1: Input: nums

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI