Array Rotation Coding | Dataford Interview Questions

Zensar Technologies may need to reorder sequential data without allocating another full array. Given an integer array, perform its kth rotation, defined here as a left rotation by k positions.

Implement kth_rotation(nums, k) so that the input array is modified in place and returned.

Formal Specification

Input: nums, a mutable list of integers, and k, a non-negative integer.
Output: The same list object after a left rotation by k positions.
If k is greater than the array length, treat it modulo the array length.
An empty array must be returned unchanged.

Constraints

0 <= nums.length <= 10^5
0 <= k <= 10^9
-10^9 <= nums[i] <= 10^9
The rotation must use O(1) auxiliary space
The result must be produced in O(n) time

Function Signature

def kth_rotation(nums, k):

Your question is Array Rotation Coding. 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