clojure-hackos.circular-rotation

Solves the Circular Array Rotation challenge. See: https://www.hackerrank.com/challenges/circular-array-rotation

rotate

(rotate a k queries)

About 6x faster than rotate-slow

rotate-slow

(rotate-slow a k queries)

Finds the elements at each index in queries after rotating the given array a k number of times.

Note This function can only solve for small arrays within the time limit. See rotate for the real solution.