Given an integer array nums, return the greatest common divisor of the smallest number and the largest number in nums.

Note: The greatest common divisor of two numbers is the largest positive integer that evenly divides both numbers.

Constraints:

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

• $1 \leq$ nums[i] $\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.