@AlgoPrep - 1 - Array - Rotate n times

rotate by one n times advance swapping reverse in 3 parts class Solution { public: void rotate(vector<int>& nums, int k) { for(int n=0;n<k;n++){ int endPointer = nums.size()-1; for(int i=0;i<nums.size();i++){ ...