[Leetcode] 1299. Replace Elements with Greatest Element on Right Side

https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/

class Solution:
    def replaceElements(self, arr: List[int]) -> List[int]:

        result = []
        before = max(arr)

        for i in range(len(arr) - 1):
            if arr[i] == before:
                before = max(arr[i+1:])
            result.append(before)
        result.append(-1)

        return result