You are viewing a single comment's thread. Return to all comments →
what is the faster?
def circularArrayRotation(a, k, queries): a = a[-k:] + a[:-k] return [a[i] for i in queries]
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)
hi @vasilij_kolomie1 your code doesn't work for test case 4
Yes when the number of rotations is too big you need to use use rotations mod number of prisoners
Circular Array Rotation
You are viewing a single comment's thread. Return to all comments →
what is the faster?
or we can simply do like this by using python collections
hi @vasilij_kolomie1 your code doesn't work for test case 4
Yes when the number of rotations is too big you need to use use rotations mod number of prisoners