Problem
Rotate the list to the right by steps positions: the last element moves to the front, steps times.
Implement rotate_right(numbers, steps).
Input
numbers: The list of integers. steps: How many positions to rotate.
Output
Return the rotated list.
Constraints
0 ≤ length ≤ 100,000; 0 ≤ steps ≤ 10⁹
Examples
Example 1
Input:
steps = 2
numbers = [1, 2, 3, 4, 5]
Expected output:
expected = [4, 5, 1, 2, 3]Input:
long long steps = 2;
std::vector<long long> numbers = {1, 2, 3, 4, 5};
Expected output:
std::vector<long long> expected = {4, 5, 1, 2, 3};Input:
long steps = 2;
long[] numbers = new long[] {1, 2, 3, 4, 5};
Expected output:
long[] expected = new long[] {4, 5, 1, 2, 3};Explanation
Two right rotations: [5, 1, 2, 3, 4], then [4, 5, 1, 2, 3].
Example 2
Input:
steps = 3
numbers = [1, 2, 3]
Expected output:
expected = [1, 2, 3]Input:
long long steps = 3;
std::vector<long long> numbers = {1, 2, 3};
Expected output:
std::vector<long long> expected = {1, 2, 3};Input:
long steps = 3;
long[] numbers = new long[] {1, 2, 3};
Expected output:
long[] expected = new long[] {1, 2, 3};Explanation
Rotating by the length brings the list back: [1, 2, 3].
References
This challenge is adapted for CodeUtility. Follow the statement and constraints above.