Question:

Given an array, rotate the array to the right by k steps, where k is non-negative.

Example:

  1. Input: [1,2,3,4,5,6,7] and k = 3
  2. Output: [5,6,7,1,2,3,4]
  3. Explanation:
  4. rotate 1 steps to the right: [7,1,2,3,4,5,6]
  5. rotate 2 steps to the right: [6,7,1,2,3,4,5]
  6. rotate 3 steps to the right: [5,6,7,1,2,3,4]
Input: [-1,-100,3,99] and k = 2
Output: [3,99,-1,-100]
Explanation: 
rotate 1 steps to the right: [99,-1,-100,3]
rotate 2 steps to the right: [3,99,-1,-100]

Solution:

/**
 * @param {number[]} nums
 * @param {number} k
 * @return {void} Do not return anything, modify nums in-place instead.
 */
var rotate = function(nums, k) {
    let temp;
    for ( let i = 0 ; i < k; i++ ) {
        temp = nums.pop();
        nums.unshift(temp);
    }
    return nums
};

Runtime: 96 ms, faster than 55.03% of JavaScript online submissions for Rotate Array.