Easy Python Solution 🐍
\nclass Solution:\n    def minimumRightShifts(self, nums: List[int]) -> int:\n        if nums==sorted(nums): return 0\n        c=0\n        for i in range(len(n
```\nclass Solution:\n    def minimumRightShifts(self, nums: List[int]) -> int:\n        if nums==sorted(nums): return 0\n        c=0\n        for i in range(len(nums)):\n            nums=nums[-1:]+nums[:-1]\n            c+=1\n            if nums==sorted(nums): return c\n        return -1\n```\n***Hope it helps...!!*** \uD83D\uDE07\u270C\uFE0F
['Python3']