Rotate Array Efficiently | Dataford Interview Questions

A Crowe analytics workflow receives an in-memory sequence of integer values that must be shifted cyclically before processing. Given an array nums and a nonnegative integer k, rotate the array to the right by k positions, modify the array in place, and return it.

Use constant auxiliary space. Since rotating by the array length produces the original array, reduce k before performing the rotation.

Formal Specification

Input: nums, a list of integers, and k, a nonnegative integer.
Output: The same list object after its elements have been rotated right by k positions.
A right rotation moves each element to index (current_index + k) % len(nums).

Constraints

1 <= len(nums) <= 10^5
0 <= k <= 10^9
-10^9 <= nums[i] <= 10^9
The array must be modified in place
Use O(1) auxiliary space

Function Signature

def rotate_array(nums, k):

Your question is Rotate Array Efficiently. 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