You are given an integer array nums that represents a circular array.

Create a new array result of the same length, where for each index i:

• If nums[i] $> 0$, advance nums[i] steps to the right and set result[i] to the value at the arrival index.

• If nums[i] $< 0$, move $|$nums[i]$|$ steps to the left and set result[i] to the value at the arrival index.

• If nums[i] $= 0$, set result[i] to nums[i].

Return the resulting array result.

Note: A circular array wraps around continuously, meaning moving forward past the last element cycles back to the first element, and moving backward past the first element cycles to the last element.

Constraints:

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

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

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.