Given an integer array arr of even length, determine whether it is possible to rearrange arr such that arr$[2 \cdot i + 1] = 2 \cdot$ arr$[2 \cdot i]$ for all $0 \le i < \frac{ arr.length}{2}$. Return true if such a reordering exists, or false otherwise.

Constraints:

• $2 \le$ arr.length $\le 3 \times 10^4$

• arr.length is even.

• $-10^5 \le$ arr[i] $\le 10^5$

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.