The problem of today is easy to solve if we do not care about finding an elegant solution. But if you know the philosophy of this blog, you will notice that the objective is to find (if possible) the most elegant solution.
We consider an array of n elements and the goal is to rotate the elements of this
array to the right by k steps.
Here is an example, consider the following array: [1,2,3,4,5,6,7] then n = 7.
Given k=3, the new rotated array is the following: [5,6,7,1,2,3,4].
Several solutions exist, I know 2 of them and especially one which is O(n) in time and 0(1) in space.
Try to find it and come back in a while for the reasonning step.