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.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Circular Array Rotation
  5. Discussions

Circular Array Rotation

  • kr__shubham
     + 2 comments

    An easy Approch with vector insert and pop_back. 1 2 3 4 5 after 1st rotation 5 1 2 3 4 after second rotation 4 5 1 2 3 after 3rd rotation 3 4 5 1 2 and so on .........

        while(k--){
        int temp;
        temp=a[a.size()-1];
        a.insert(a.begin(),temp);
        a.pop_back();
    }
vector<int>arr;
for(int i=0; i<queries.size();i++)
       arr.push_back(a[queries[i]]);

return arr;
}