Challenge: Find Two Pairs in an Array Such That a+b = c+d

Statement

Given an array of distinct integers, nums, determine whether there exist two pairs, $(a, b)$ and $(c, d)$, such that $a + b = c + d$, where $a$, $b$, $c$, and $d$ are unique elements within the array. If there are multiple solutions, return any one of them.

Constraints:

• $4 \leq$ nums.length $\leq 10^3$

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

Examples