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

/**
 * 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);
};