Rotate Array Right

A quick note: this problem is backed by a real Omnissa onsite interview report that directly named rotating an array right by k steps. The report did not include an exact function interface, examples, constraints, or behavior for large k. The core task match is about 95%.
You are given an integer array nums and an integer k. Rotate the array to the right by k steps and return the rotated array.
Interview Follow-up
This was part of a rapid-fire three-problem round in which the candidate presented brute-force, improved, and optimal approaches and wrote working code for each problem.

Function
rotateRight(nums: int[], k: int) → int[]

Examples
Example 1
nums = [1,2,3,4,5,6,7]
k = 3
return = [5,6,7,1,2,3,4]
Moving the last three values to the front gives [5,6,7,1,2,3,4].
Example 2
nums = [-1,-100,3,99]
k = 2
return = [3,99,-1,-100]
After two right rotations, 3 and 99 move to the front.

The data structure is just the array, and the trick is index math. Brute force shifts the array right by one, k times, which costs O(n*k). Better: copy into a new array and place each value at (i + k) % n, which is O(n) time and O(n) space. Optimal is three reversals in place: reverse the whole array, reverse the first k elements, then reverse the rest. That gives O(n) time and O(1) space. The pitfall is k. The report doesn't say how large k can get, so always do k = k % n first. Skip that and you get wrong answers or index errors when k exceeds the length. Also handle an empty array before taking the modulus, or you divide by zero. Walk through Example 1 by hand before you submit. If the live OA throws you off, StealthCoder is the backup that reads the screen and gives you the reversal code.

Memorize the pattern. If you can't, run StealthCoder. The proctor sees the IDE. They don't see what's behind it.