Given a $0$ indexed integer array nums, determine if there exist two distinct subarrays of length $2$ that have the same sum.

Return true if such subarrays exist, or false otherwise.

Note: Two subarrays are considered distinct if they begin at different starting indices, even if their elements are identical.

Constraints:

• $2 \leq$ nums.length $\leq 1000$

• $-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.