Add solution #1299

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,214 LeetCode solutions in JavaScript
+# 1,215 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -982,6 +982,7 @@
 1296|[Divide Array in Sets of K Consecutive Numbers](./solutions/1296-divide-array-in-sets-of-k-consecutive-numbers.js)|Medium|
 1297|[Maximum Number of Occurrences of a Substring](./solutions/1297-maximum-number-of-occurrences-of-a-substring.js)|Medium|
 1298|[Maximum Candies You Can Get from Boxes](./solutions/1298-maximum-candies-you-can-get-from-boxes.js)|Hard|
+1299|[Replace Elements with Greatest Element on Right Side](./solutions/1299-replace-elements-with-greatest-element-on-right-side.js)|Easy|
 1304|[Find N Unique Integers Sum up to Zero](./solutions/1304-find-n-unique-integers-sum-up-to-zero.js)|Easy|
 1309|[Decrypt String from Alphabet to Integer Mapping](./solutions/1309-decrypt-string-from-alphabet-to-integer-mapping.js)|Easy|
 1313|[Decompress Run-Length Encoded List](./solutions/1313-decompress-run-length-encoded-list.js)|Easy|

solutions/1299-replace-elements-with-greatest-element-on-right-side.js

@@ -0,0 +1,24 @@
+/**
+ * 1299. Replace Elements with Greatest Element on Right Side
+ * https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @param {number[]} arr
+ * @return {number[]}
+ */
+var replaceElements = function(arr) {
+  let maxRight = -1;
+  for (let i = arr.length - 1; i >= 0; i--) {
+    const current = arr[i];
+    arr[i] = maxRight;
+    maxRight = Math.max(maxRight, current);
+  }
+  return arr;
+};