Leetcode Problem 1299. Replace Elements with Greatest Element on Right Side

Algorithm

1. Initialize maxRight to -1.
2. Start from the last element of the array and iterate backwards.
3. For each element at index i: a. Store the current element in a temporary variable temp. b. Replace the current element with maxRight. c. Update maxRight to the maximum of temp and maxRight.
4. Continue this process until the first element of the array is reached.
5. The array now contains the greatest elements to the right for each position.