Given an integer array, nums, shift its elements to the right by k positions. In other words, rotate the array to the right by k steps, where k is non-negative.

Constraints:

• $1 \leq$ nums.length $\leq 10^3$

• $-2^{-31} \leq$ nums[i] $2^{31} - 1$

• $0 \leq$ k $\leq 10^3$

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.