replace-elements-with-greatest-element-on-right-side.cpp

// Time:  O(n)
// Space: O(1)

class Solution {
public:
    vector<int> replaceElements(vector<int>& arr) {
        int curr_max = -1;
        for (int i = arr.size() - 1; i >= 0; --i) {
            tie(arr[i], curr_max) = make_pair(curr_max, max(curr_max, arr[i]));
        }
        return arr;
    }
};