easy solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python []
class Solution(object):
    def minimumRightShifts(self, nums):
        a = 0
        s = nums[:]
        s.sort()
        for x in range(len(nums)):
            if nums==s:
                return a
            nums= nums[len(nums) - 1:len(nums)] + nums[0:len(nums) - 1]
            a=a+1
        return -1

        
```
['Python']