Given two positive integer arrays nums and numsDivide, you can delete any number of elements from nums.

Return the minimum number of deletions needed such that the smallest element in nums divides all elements of numsDivide. If no such element exists after any number of deletions, return $-1$.

Note: An integer $x$ divides $y$ if $y \pmod x = 0$.

Constraints:

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

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