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.
Thanks bro, it mathematical approach I like it.
but i thing you done misticks in this code?
for (int oldIndex = 0; oldIndex < n; oldIndex++) {
int newIndex = (oldIndex + d) % n;
rotArray[newIndex] = a[oldIndex];
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Left Rotation
You are viewing a single comment's thread. Return to all comments →
Thanks bro, it mathematical approach I like it. but i thing you done misticks in this code? for (int oldIndex = 0; oldIndex < n; oldIndex++) { int newIndex = (oldIndex + d) % n; rotArray[newIndex] = a[oldIndex]; }