Add solution #1646

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,445 LeetCode solutions in JavaScript
+# 1,446 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1268,6 +1268,7 @@
 1641|[Count Sorted Vowel Strings](./solutions/1641-count-sorted-vowel-strings.js)|Medium|
 1642|[Furthest Building You Can Reach](./solutions/1642-furthest-building-you-can-reach.js)|Medium|
 1643|[Kth Smallest Instructions](./solutions/1643-kth-smallest-instructions.js)|Hard|
+1646|[Get Maximum in Generated Array](./solutions/1646-get-maximum-in-generated-array.js)|Easy|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|
 1669|[Merge In Between Linked Lists](./solutions/1669-merge-in-between-linked-lists.js)|Medium|

solutions/1646-get-maximum-in-generated-array.js

@@ -0,0 +1,39 @@
+/**
+ * 1646. Get Maximum in Generated Array
+ * https://leetcode.com/problems/get-maximum-in-generated-array/
+ * Difficulty: Easy
+ *
+ * You are given an integer n. A 0-indexed integer array nums of length n + 1 is generated
+ * in the following way:
+ * - nums[0] = 0
+ * - nums[1] = 1
+ * - nums[2 * i] = nums[i] when 2 <= 2 * i <= n
+ * - nums[2 * i + 1] = nums[i] + nums[i + 1] when 2 <= 2 * i + 1 <= n
+ *
+ * Return the maximum integer in the array nums.
+ */
+
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var getMaximumGenerated = function(n) {
+  if (n === 0) return 0;
+
+  const generatedArray = new Array(n + 1).fill(0);
+  generatedArray[1] = 1;
+  let maximumValue = 1;
+
+  for (let i = 1; i <= Math.floor(n / 2); i++) {
+    if (2 * i <= n) {
+      generatedArray[2 * i] = generatedArray[i];
+      maximumValue = Math.max(maximumValue, generatedArray[2 * i]);
+    }
+    if (2 * i + 1 <= n) {
+      generatedArray[2 * i + 1] = generatedArray[i] + generatedArray[i + 1];
+      maximumValue = Math.max(maximumValue, generatedArray[2 * i + 1]);
+    }
+  }
+
+  return maximumValue;
+};