You are given an integer array nums of even length.

Alice and Bob play a game with nums and an initially empty array arr. The game continues until nums is empty, where in each round:

• Alice removes the smallest element currently in nums.

• Bob then removes the smallest element from the remaining elements in nums.

• Bob appends his removed element to arr.

• Alice appends her removed element to arr.

Return the resulting array arr.

Constraints:

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

• $1 \leq$ nums[i] $\leq 100$

• nums.length $\\% 2 = 0$

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.