leetcode-grind/problems/1299/main.py

class Solution:
    def replaceElements(self, arr):
        res = []
        for (ind, n) in enumerate(arr[0:len(arr)-1]):
            biggest = arr[ind + 1]
            for x in arr[ind + 1:]:
                if x > biggest:
                    biggest = x
            res.append(biggest)
        res.append(-1)
        return res

s = Solution()
print("Expected: [18,6,6,6,1,-1]")
print("Got:", s.replaceElements([17,18,5,4,6,1]))