#include <iostream>
#include<vector>
using namespace std;
// create a function for the given problems
class Solution {
public:
void rotate(vector<int>& nums, int k)
{
// If rotation is greater
// than size of array
int n=nums.size();
k = k % n;
for(int i = 0; i < n; i++)
{
if(i < k)
{
// Printing rightmost
// kth elements
cout << nums[n + i - k] << " ";
}
else
{
// Prints array after
// 'k' elements
cout << (nums[i - k]) << " ";
}
}
cout << "\n";
}
};
int main() {
// your code goes here
Solution s1;
vector<int> v1={3,4,5,6,7};
s1.rotate(v1,3);
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTx2ZWN0b3I+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwovLyBjcmVhdGUgYSBmdW5jdGlvbiBmb3IgdGhlIGdpdmVuIHByb2JsZW1zCmNsYXNzIFNvbHV0aW9uIHsKcHVibGljOgogIHZvaWQgcm90YXRlKHZlY3RvcjxpbnQ+JiBudW1zLCBpbnQgaykKewogICAgCiAgICAvLyBJZiByb3RhdGlvbiBpcyBncmVhdGVyIAogICAgLy8gdGhhbiBzaXplIG9mIGFycmF5CiAgICBpbnQgbj1udW1zLnNpemUoKTsKICAgICBrID0gayAlIG47CgogICAgZm9yKGludCBpID0gMDsgaSA8IG47IGkrKykKICAgIHsKICAgICAgIGlmKGkgPCBrKQogICAgICAgewogICAgICAgICAgIAogICAgICAgICAgIC8vIFByaW50aW5nIHJpZ2h0bW9zdCAKICAgICAgICAgICAvLyBrdGggZWxlbWVudHMKICAgICAgICAgICBjb3V0IDw8IG51bXNbbiArIGkgLSBrXSA8PCAiICI7CiAgICAgICB9CiAgICAgICBlbHNlCiAgICAgICB7CiAgICAgICAgICAgCiAgICAgICAgICAgLy8gUHJpbnRzIGFycmF5IGFmdGVyCiAgICAgICAgICAgLy8gJ2snIGVsZW1lbnRzCiAgICAgICAgICAgY291dCA8PCAobnVtc1tpIC0ga10pIDw8ICIgIjsKICAgICAgIH0KICAgIH0KICAgIGNvdXQgPDwgIlxuIjsKfQp9OwoKCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJU29sdXRpb24gczE7Cgl2ZWN0b3I8aW50PiB2MT17Myw0LDUsNiw3fTsKCXMxLnJvdGF0ZSh2MSwzKTsKCQoKCQoJcmV0dXJuIDA7Cn0=