You are given an integer array nums of length $2n$, where the first $n$ elements are x1, x2, ..., xn and the last $n$ elements are y1, y2, ..., yn. Return a new array formed by interleaving these two halves in the order x1, y1, x2, y2, ..., xn, yn.

Implement List[int] shuffle(self, List[int] nums, int n) to produce the shuffled array.

Constraints:

• $1 \leq$ n $\leq 500$

• nums.length $==$ $2n$

• $1 \leq$ nums[i] $\leq 10^3$

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.