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

  • hvogue + 3 comments

    We don't need to actually rotate the array. We can just use basic math to pull the entry from the original array:

            int shift = n - (k % n);
        int index = (shift + m ) % n;
    • devvrat_arya + 0 comments

      Clever..

    • bchen_us + 1 comment

      Just to note that % in C++ only gives you the dividend. It's not the modulus like in mathematics.

      • hvogue + 0 comments

        ah yes- I should have specified that this was written in java. thanks

    • shakil_isd + 0 comments

      can you please describe??