leetcode 2855. Minimum Right Shifts to Sort the Array

https://leetcode.com/problems/minimum-right-shifts-to-sort-the-array/description/

 

class Solution:
    def minimumRightShifts(self, nums: List[int]) -> int:
        sorted_nums = sorted(nums)
        for i in range(len(nums)):
            if nums == sorted_nums:
                return i
            nums = nums[-1: -2: -1] + nums[:len(nums)-1]
        
        return -1