You are viewing a single comment's thread. Return to all comments →
C++ Solution
vector circularArrayRotation(vector a, int k, vector queries) { vector res; for(auto& q : queries) { int index = (q + a.size() - k%a.size()); if(index >= a.size()) index = index % a.size(); res.push_back(a[index]); } return res; }
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 →
C++ Solution
vector circularArrayRotation(vector a, int k, vector queries) { vector res; for(auto& q : queries) { int index = (q + a.size() - k%a.size()); if(index >= a.size()) index = index % a.size(); res.push_back(a[index]); } return res; }