Add LeetCode 1299 solutions (Tahanima#59)

Author: Tahanima

Algorithms/Easy/1299_ReplaceElementsWithGreatestElementOnRightSide/Solution.cpp

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

Algorithms/Easy/1299_ReplaceElementsWithGreatestElementOnRightSide/Solution.cs

@@ -0,0 +1,13 @@
+public class Solution {
+    public int[] ReplaceElements(int[] arr) {
+        int size = arr.Length, maxVal = -1;
+        int[] answer = new int[size];
+        
+        for (int i = size - 1; i >= 0; i--) {
+            answer[i] = maxVal;
+            maxVal = Math.Max(maxVal, arr[i]);
+        }
+        
+        return answer; 
+    }
+}

Algorithms/Easy/1299_ReplaceElementsWithGreatestElementOnRightSide/Solution.java

@@ -0,0 +1,13 @@
+class Solution {
+    public int[] replaceElements(int[] arr) {
+        int size = arr.length, maxVal = -1;
+        int[] answer = new int[size];
+        
+        for (int i = size - 1; i >= 0; i--) {
+            answer[i] = maxVal;
+            maxVal = Math.max(maxVal, arr[i]);
+        }
+        
+        return answer;
+    }
+}