Given an integer array nums containing the same number of positive and negative values, reorder its elements so that the resulting array alternates by sign, starting with a positive number at index $0$. In other words, for every even index $i$, the value at nums[i] must be positive, and for every odd index $i$, the value at nums[i] must be negative.

Return the rearranged array.

Note: It is not required to perform the rearrangement in place.

Constraints:

• $2 \leq$ nums.length $\leq 2 \cdot 10^5$

• nums.length is even

• $1 \leq \lvert$ nums[i] $\rvert \leq 10^5$

• nums contains an equal number of positive and negative integers

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.