This website uses cookies to enhance the user experience

Array Rotation

Difficulty: 💪🏽 Medium

Problem Statement

Given an array of integers and a number k, rotate the array to the right by k steps.

Example
Input: nums = [1, 2, 3, 4, 5, 6, 7], k = 3
Output: [5, 6, 7, 1, 2, 3, 4]

Input: nums = [-1, -100, 3, 99], k = 2
Output: [3, 99, -1, -100]
Constraints
  • 1 <= nums.length <= 10^5
  • -2^31 <= nums[i] <= 2^31 - 1
  • 0 <= k <= 10^5

Expected Challenge Output

When the function rotateArray is called with the given example inputs, the expected output is the rotated array.

const nums1 = [1, 2, 3, 4, 5, 6, 7];
const k1 = 3;
console.log(rotateArray(nums1, k1));  // Output: [5, 6, 7, 1, 2, 3, 4]

const nums2 = [-1, -100, 3, 99];
const k2 = 2;
console.log(rotateArray(nums2, k2));  // Output: [3, 99, -1, -100]
function rotateArray(nums, k) {
// YOUR SOLUTION HERE
}

Memory: 0

CPU: 0