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.
Position resulting because of rotation is computed first using ((i++ + k) % n).Then the array elements are stored in these positions in the read ing stage itself using scanf() .
Suggestions are welcome!
Cookie support is required to access HackerRank
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 →
Nice one!
Here is my code in C.
Position resulting because of rotation is computed first using
((i++ + k) % n)
.Then the array elements are stored in these positions in the read ing stage itself usingscanf()
. Suggestions are welcome!