Gamified challenge · Array reversal
horses lists the horses on the carousel by position, and the carousel turns k places to the right: the horse at position i ends at position (i + k) mod n, so the last horses wrap round to the front. k can be bigger than the number of horses.
Write rotate(horses, k) that returns the horses in their new order. Aim for O(1) extra memory with three reversals. An empty carousel returns [].
For horses = [1, 2, 3, 4, 5, 6, 7] and k = 3 the answer is [5, 6, 7, 1, 2, 3, 4].
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google