Rotate Array by K | Dataford Interview Questions

A Hexaware Technologies client-processing service stores pending work items in an ordered array. Implement a function that rotates nums to the right by k positions, modifying the same array and returning it.

A right rotation moves each element k positions later in the array. Elements that move beyond the last index wrap to the front. Because k may exceed the array length, normalize it before rotating.

Formal Specification

Input: nums, a list of integers, and k, a non-negative integer.
Output: Return nums after it has been rotated right by k positions.
Requirement: Modify nums in place and use O(1) auxiliary space.

Constraints

0 <= len(nums) <= 100,000
-10^9 <= nums[i] <= 10^9
0 <= k <= 10^9
Modify nums in place
Use O(1) auxiliary space

Function Signature

def rotate_right(nums, k):

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

Formal Specification

Input: nums, a list of integers, and k, a non-negative integer.
Output: Return nums after it has been rotated right by k positions.
Requirement: Modify nums in place and use O(1) auxiliary space.

Constraints

0 <= len(nums) <= 100,000
-10^9 <= nums[i] <= 10^9
0 <= k <= 10^9
Modify nums in place
Use O(1) auxiliary space

Function Signature

def rotate_right(nums, k):

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