You are given an array of integers nums and an integer original.

Search for original in nums. If the value is found, multiply original by $2$ and repeat the search process. Continue this operation as long as the current value of original is present in nums.

Return the resulting value of original once it is no longer found in nums.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $1 \leq$ nums[i], original $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.