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

Circular Array Rotation

  • Dinesh1306 + 2 comments

    Modular arithmetic is the best way to do this problem. No need to actually rotate the array. Take a look here. Circular Array Rotation

    • cjreasoner + 3 comments

      Python solution using mod:

      ls = [int(x) for x in input().split()]
n = ls[0]
k = ls[1]
queries = ls[2]
array = [int(x) for x in input().split()]
result = []
for q in range(queries):
    q = int(input())
    result.append(array[q-k % n])
for e in result:
    print(e)
      • hassan2020mainul + 1 comment

        Here is another Python Solution:-

        n,k,q = input().strip().split(' ') n,k,q = [int(n),int(k),int(q)] a = [int(a_temp) for a_temp in input().strip().split(' ')]

        for i in range(q): m = int(input().strip()) print(a[(m-k)%len(a)])

        • msambitkumar1991 + 0 comments

          @hasan2020mainul can you explain the operation a(m-k)%len(a) you did?

      • vacky11 + 0 comments

        Another simple python solution

        #!/bin/python

import sys

n,k,q = raw_input().strip().split(' ')
n,k,q = [int(n),int(k),int(q)]
a = map(int,raw_input().strip().split(' '))
a = a[n-(k%n):n]+a[0:n-(k%n)]
for a0 in xrange(q):
    m = int(raw_input().strip())
    print a[m]
      • vasilij_kolomie1 + 2 comments

        what is the faster?

        def circularArrayRotation(a, k, queries):
             a = a[-k:] + a[:-k]
            return [a[i] for i in queries]

        • logical_beast + 0 comments

          or we can simply do like this by using python collections

          import collections
def circularArrayRotation(a, k, queries):
    d = collections.deque(a)
    d.rotate(k)
    return (d[i] for i in queries)
        • logical_beast + 1 comment

          hi @vasilij_kolomie1 your code doesn't work for test case 4

          • kuanwu01 + 0 comments

            Yes when the number of rotations is too big you need to use use rotations mod number of prisoners

    • ghassan_karwchan + 2 comments
      def circularArrayRotation(a, k, queries):
    return [a[(val - k) % len(a)] for val in queries]
      • Tej_Pratap_Singh + 0 comments
        [deleted]
      • CS_1734810___ + 0 comments

        hello Sir, Will you explain your logic of this problem