Given an integer array arr, replace every element in the array with the greatest element among all elements to its right, and replace the final element with $-1$.

Return the modified array.

Constraints:

• $1 \leq$ arr.length $\leq 10^4$

• $1 \leq$ arr[i] $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.