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.
  1. Practice
  2. Algorithms
  3. Implementation
  4. Circular Array Rotation
  5. Discussions

Circular Array Rotation

  • gary_l_hewitt + 1 comment

    More algorithmic? - I don't see any reason to mutate the arrays at all, if all you need is the correct indexes from the rotated input. This just plucks the relevant items from the (rotated) indexes in the query:

    function circularArrayRotation(a, k, queries) {
    let offset = a.length - (k % a.length);
    return queries.map( e => a[(e+offset)%a.length]);
}
    • ujjwal78 + 1 comment

      Ah,thanks I got it.. It's all about algorithmic complexity.

      • gary_l_hewitt + 0 comments

        This is O(n) where n is the length of the queries array. It is independent of the length of the input array, since it grabs the input array elements by index and only has to loop through the queries to grab each one.