Rotate array right
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].
Implement
rotate_right(nums: list[int], k: int) → list[int]Examples
in
[[1,2,3,4,5],2]out[4,5,1,2,3]What a strong answer looks like
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.
0:00 of about 15 min
solution.py
InputExpectedGot
[[1,2,3,4,5],2][4,5,1,2,3]not run yetsample