Given an integer array nums of length n, construct an array ans of length $2n$ such that ans[i] == nums[i] and ans[i + n] == nums[i] for $0 \leq$ i $<$ n (0-indexed).

In other words, ans is formed by appending nums to itself.

Return the array ans.

Constraints:

• n $==$ nums.length

• $1 \leq$ n $\leq 10^3$

• $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.