Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn].

Return the array in the form [x1,y1,x2,y2,...,xn,yn].

&nbsp;
Example 1:

Input: nums = [2,5,1,3,4,7], n = 3
Output: [2,3,5,4,1,7] 
Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7].


Example 2:

Input: nums = [1,2,3,4,4,3,2,1], n = 4
Output: [1,4,2,3,3,2,4,1]


Example 3:

Input: nums = [1,1,2,2], n = 2
Output: [1,2,1,2]


&nbsp;
Constraints:


	1 &lt;= n &lt;= 500
	nums.length == 2n
	1 &lt;= nums[i] &lt;= 10^3

'''
First of all, I'm making a few tuples  using zip function.
Then extracting every created tuple. (for tup in zip())
After that, I can take numbers from the extracted tuples, in order to add them to a list and return. (for number in tup)
'''
class Solution:
    def shuffle(self, nums: List[int], n: int) -> List[int]:
        return [number for tup in zip(nums[:n], nums[n:]) for number in tup]
class Solution {
    public int[] shuffle(int[] nums, int n)
    {
        int[] arr = new int[2*n];
        int j = 0;
        int k = n;
        for(int i =0; i<2*n; i++)
        {
            if(i%2==0)
            {
                arr[i] = nums[j];
                j++;
            }
            else
            {
                arr[i] = nums[k];
                k++;
            }
        }
        return arr;
    }
}
class Solution {
public:
    vector<int> shuffle(vector<int>& nums, int n) {
        vector<int> ans;
        int size = nums.size();
        int i = 0, j =0;
        for(i=0,j=n; i<n && j<size; i++, j++){
            ans.push_back(nums[i]);
            ans.push_back(nums[j]);
        }
        return ans;
    }
};
var shuffle = function(nums, n) {
    while (n--) {
        nums.splice(n + 1, 0, nums.pop());
    }
    return nums;
};
Shuffle the Array