I found this question over leetcode, as I am learning about arrays now. The problem seems to be in the shifting block of the given code.

Example 1:

Input: nums = [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]
Explanation:
rotate 1 steps to the right: [7,1,2,3,4,5,6]
rotate 2 steps to the right: [6,7,1,2,3,4,5]
rotate 3 steps to the right: [5,6,7,1,2,3,4]

Example 2:

Input: nums = [-1,-100,3,99], 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]

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n = sizeof(nums)/sizeof(nums[0]);
        k = k%n;
        vector<int> temp;
        //storing the elements of the array till k places
        for(int i = 0; i < k; i++) {
            temp.push_back(nums[i]);
        }

        //shifting by k places
        for(int i = k; i<n;i++) {
            nums[i+k] = nums[i];
        }

        //putting the temp back to the place
        int j = 0;
        for(int i = n-k; i < n; i++) {
            nums[i] = nums[j];
            j++;
        }
    }
};

I solved for rotating the array left by k places in my local editor. I get the solution fine.

Here, according to what I know, there is a memory overflow.

I am confident the rest of the code works fine except for the shifting block.