Array Rotation | Dataford Interview Questions

Problem Statement

A Williams AV device maintains an ordered array of signal identifiers. Given an integer array nums and a nonnegative integer n, rotate the array clockwise by n positions and return the same array after modification.

A clockwise rotation moves the last element to the first position. The operation must be performed in place, without creating another array proportional to the input size.

Formal Specification

Input: nums, a mutable list of integers, and n, a nonnegative integer.
Output: The rotated list nums, modified in place.
A rotation by n positions should produce the same result as repeatedly moving the final element to the front n times.

Constraints

1 <= len(nums) <= 10^5
0 <= n <= 10^9
-10^9 <= nums[i] <= 10^9
The rotation must modify nums in place
Use O(1) auxiliary space

Function Signature

def rotate_array(nums, n):

Your question is Array Rotation. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem