Add solution #2154

Author: JoshCrozier

README.md

@@ -289,6 +289,7 @@
 2099|[Find Subsequence of Length K With the Largest Sum](./2099-find-subsequence-of-length-k-with-the-largest-sum.js)|Medium|
 2114|[Maximum Number of Words Found in Sentences](./2114-maximum-number-of-words-found-in-sentences.js)|Easy|
 2129|[Capitalize the Title](./2129-capitalize-the-title.js)|Easy|
+2154|[Keep Multiplying Found Values by Two](./2154-keep-multiplying-found-values-by-two.js)|Easy|
 2244|[Minimum Rounds to Complete All Tasks](./2244-minimum-rounds-to-complete-all-tasks.js)|Medium|
 2427|[Number of Common Factors](./2427-number-of-common-factors.js)|Easy|
 

solutions/2154-keep-multiplying-found-values-by-two.js

@@ -0,0 +1,25 @@
+/**
+ * 2154. Keep Multiplying Found Values by Two
+ * https://leetcode.com/problems/keep-multiplying-found-values-by-two/
+ * Difficulty: Easy
+ *
+ * You are given an array of integers nums. You are also given an integer original which
+ * is the first number that needs to be searched for in nums.
+ *
+ * You then do the following steps:
+ * If original is found in nums, multiply it by two (i.e., set original = 2 * original).
+ * Otherwise, stop the process.
+ * Repeat this process with the new number as long as you keep finding the number.
+ * Return the final value of original.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} original
+ * @return {number}
+ */
+var findFinalValue = function(nums, original) {
+  return nums
+    .sort((a, b) => a - b)
+    .reduce((result, n) => result *= n === result ? 2 : 1, original);
+};