Codility CyclicRotation Python

Key Takeaways

cyclic rotation to rotate an array is that each element of a will be shifted to the right do this a total of K times so we send us input the array a and K for the amount of times that each element will be shifted to the right so we have a simple test case that a Isner is an array of 3 8 9 7 6 and we should rotate this three times so for example this 3 should move to the right and then when it's here should move one more to the right and then one more for a total of 3 rotations and we see that the three ends up at that position so see how we can solve this one thing we can do first is we can check if if their length is zero and we should just return them to the list there are no rotations and one simple way to do this is we can do for for a small K in range of K we can do a is C the last element will be the first one and then we will just I remember this will just be an element so we need to make a list out of this but we can keep it like this so this will be a list and we can use list comprehension and we can use all up to the last element and then just return a and I think this should work no ok let's see what doesn't work all right the solution end so there's a knave and Kate and then we get the correct solution one I guess optimize a optimization thing we can do is that let's say that the amount of times we will shift it is the length of a then we know that it will just each element will just return to aid that was in the beginning so we can say that the net rotations is Len of a plus K and then just take this modulus len away and instead of using K here we can say for cane range of net rotations so that gives the same result but if K is greater than much much greater than the length of a then we will have some cycles and we can just instantly remove those cycles by taking modulus if you have any questions about this or if you have any improvements on this then please comment and so I can learn and improve alright thanks for watching