We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
vector circularArrayRotation(vector & arr, int k, vector queries)
{ vector res;
// k % arr.size() enusre that we are not unnecessarily rotating back to original
std::rotate(arr.rbegin(), arr.rbegin() + (k % arr.size()), arr.rend());
for (auto a : queries)
res.push_back(arr[a]);
return res;
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Circular Array Rotation
You are viewing a single comment's thread. Return to all comments →
My C++ solution
vector circularArrayRotation(vector & arr, int k, vector queries) { vector res; // k % arr.size() enusre that we are not unnecessarily rotating back to original std::rotate(arr.rbegin(), arr.rbegin() + (k % arr.size()), arr.rend());
}