Leetcode 1299. Replace Elements with Greatest Element on Right Side

class Solution:
    def replaceElements(self, arr: List[int]) -> List[int]:
        n = len(arr)
        result = [-1] * n
        indexes = sorted(range(n), key=lambda i: arr[i], reverse=True)
        left = 0
        for i in range(n):
            index = indexes[i]
            for j in range(left, index):
                result[j] = arr[index]
            left = max(left, index)
        return result

class Solution:
    def replaceElements(self, arr: List[int]) -> List[int]:
        n = len(arr)
        result = [-1] * n
        maximum = arr[-1]
        i = n - 2
        while i > -1:
            result[i] = maximum
            maximum = max(maximum, arr[i])
            i -= 1
        return result