Heres my solution . I did indexed based solution . Kindly comment and tell me does it have higher complexity than iteration based approach .

```
class Solution:
# @param a : list of integers
# @param b : integer
# @return a list of integers
def rotateArray(self, a, b):
# base case :
l = len(a)
if b<l:
return a[b:] + a[:b]
else:
b = b%l
return a[b:] + a[:b]
```