You are given an integer array nums where the largest integer is unique.

Determine whether the largest element in nums is at least twice as large as every other number in the array. If it is, return the index of the largest element. Otherwise, return $-1$.

Constraints:

• $2 \leq$ nums.length $\leq 50$

• $0 \leq$ nums[i] $\leq 100$

• The largest element in nums is unique.

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.