Given an array of integers barcodes, rearrange its elements such that no two adjacent elements are equal. Return any valid arrangement. It is guaranteed that a valid answer always exists.

Constraints:

• $1 \le$ barcodes.length $\le 10000$

• $1 \le$ barcodes[i] $\le 10000$

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.