No.169 - LeetCode1299

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