https://leetcode.com/problems/steps-to-make-array-non-decreasing/


Time Limit Exceeded


```python
class Solution:
    def totalSteps(self, nums: List[int]) -> int:
        #09:19
        if len(nums) < 2:
            return 0
        
        counting = 0
        while True:
            index_that_need_to_get_removed = []
            for i, a in enumerate(nums):
                if ((i+1) <= len(nums) - 1):
                    b = nums[i + 1]
                    if a > b:
                         index_that_need_to_get_removed.append(i + 1)
            if (len(index_that_need_to_get_removed) == 0):
                break
            else:
                counting += 1
            nums = [num for i, num in enumerate(nums) if index_that_need_to_get_removed.count(i) == 0]
        
        return counting
        #9:28
```