You are given an integer array nums. Initially, you have an array arr of the same length where every element is set to $0$.

In one operation, you can apply either of the following function calls:

1. Increment by $1$: Choose any index i and increase the value of arr[i] by $1$.

2. Multiply by $2$: Multiply every element in the entire array arr by $2$.

Return the minimum number of function calls required to make arr equal to nums.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^9$

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.