1299. Replace Elements with Greatest Element on Right Side. Description.

Author: welder87

description_of_tasks/lc_1299_replace_elements_with_gt_element_on_right.md

@@ -0,0 +1,52 @@
+# 1299. Replace Elements with Greatest Element on Right Side
+
+Given an array `arr`, replace every element in that array with the greatest element among the elements to its right, and replace the last element with `-1`.
+
+After doing so, return the array.
+
+**Example 1:**
+
+> **Input:** arr = [17,18,5,4,6,1]
+>
+> **Output:** [18,6,6,6,1,-1]
+>
+> **Explanation:**
+>
+> - index 0 --> the greatest element to the right of index 0 is index 1 (18).
+> - index 1 --> the greatest element to the right of index 1 is index 4 (6).
+> - index 2 --> the greatest element to the right of index 2 is index 4 (6).
+> - index 3 --> the greatest element to the right of index 3 is index 4 (6).
+> - index 4 --> the greatest element to the right of index 4 is index 5 (1).
+> - index 5 --> there are no elements to the right of index 5, so we put -1.
+
+**Example 2:**
+
+> **Input:** arr = [400]
+>
+> **Output:** [-1]
+>
+> **Explanation:** There are no elements to the right of index 0.
+
+## Constraints
+
+- $1 <= arr.length <= 10^4$
+- $1 <= arr[i] <= 10^5$
+
+## Topics
+
+- `Array`
+
+## Hints
+
+1. Loop through the array starting from the end.
+2. Keep the maximum value seen so far.
+
+## Similar Questions
+
+Hard
+
+- [2454. Next Greater Element IV](2454_next_greater_element_4.md)
+
+Easy
+
+- [2078. Two Furthest Houses With Different Colors](2078_two_furthest_houses_with_different_colors.md)