Question
Given an integer array nums and a non-negative integer k (which may exceed the length), rotate the array to the right by k positions in place and return it — every element moves k slots toward the end, wrapping around. Use the three-reversal trick with O(1) extra space rather than allocating a shifted copy. Example: nums = [1, 2, 3, 4, 5], k = 2 gives [4, 5, 1, 2, 3].
rotate_right(nums: list[int], k: int) → list[int][[1,2,3,4,5],2]out[4,5,1,2,3]State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.