Leetcode 1299. Replace Elements with Greatest Element on Right Side

Replace each element in the array with the greatest element among those to its right (and set the last element to -1). This is typically solved by scanning from right to left while tracking the running maximum to get O(n) time and O(1) extra space.