You are given two integer arrays, nums and divisors.

The divisibility score of an element divisors[j] is defined as the number of indices i such that nums[i] is divisible by divisors[j].

Return the integer in divisors that achieves the maximum divisibility score. If multiple values in divisors share the same maximum score, return the one with the smallest numeric value.

Constraints:

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

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