2644 - Find the Maximum Divisibility Score\.

Easy

You are given two 0-indexed integer arrays nums and divisors.

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

Return the integer divisors[i] with the maximum divisibility score. If there is more than one integer with the maximum score, return the minimum of them.

Example 1:

Input: nums = 4,7,9,3,9, divisors = 5,2,3

Output: 3

Explanation: The divisibility score for every element in divisors is:

The divisibility score of divisors0 is 0 since no number in nums is divisible by 5.

The divisibility score of divisors1 is 1 since nums0 is divisible by 2.

The divisibility score of divisors2 is 3 since nums2, nums3, and nums4 are divisible by 3.

Since divisors2 has the maximum divisibility score, we return it.

Example 2:

Input: nums = 20,14,21,10, divisors = 5,7,5

Output: 5

Explanation: The divisibility score for every element in divisors is:

The divisibility score of divisors0 is 2 since nums0 and nums3 are divisible by 5.

The divisibility score of divisors1 is 2 since nums1 and nums2 are divisible by 7.

The divisibility score of divisors2 is 2 since nums0 and nums3 are divisible by 5.

Since divisors0, divisors1, and divisors2 all have the maximum divisibility score, we return the minimum of them (i.e., divisors2).

Example 3:

Input: nums = 12, divisors = 10,16

Output: 10

Explanation: The divisibility score for every element in divisors is:

The divisibility score of divisors0 is 0 since no number in nums is divisible by 10.

The divisibility score of divisors1 is 0 since no number in nums is divisible by 16.

Since divisors0 and divisors1 both have the maximum divisibility score, we return the minimum of them (i.e., divisors0).

Constraints:

• 1 <= nums.length, divisors.length <= 1000

• <code>1 <= numsi, divisorsi<= 10⁹</code>