You are viewing a single comment's thread. Return to all comments →
This can be easily done with a one liner O(1) time and O(1) space
cout << a[(n+(m-k)%n)%n] << endl;
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 →
This can be easily done with a one liner O(1) time and O(1) space
cout << a[(n+(m-k)%n)%n] << endl;