2644. Find the Maximum Divisibility Score LeetCode Solution
In this guide, you will get 2644. Find the Maximum Divisibility Score LeetCode Solution with the best time and space complexity. The solution to Find the Maximum Divisibility Score problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
Problem Statement of Find the Maximum Divisibility Score
You are given two 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 multiple integers have the maximum score, return the smallest one.
Example 1:
Input: nums = [2,9,15,50], divisors = [5,3,7,2]
Output: 2
Explanation:
The divisibility score of divisors[0] is 2 since nums[2] and nums[3] are divisible by 5.
The divisibility score of divisors[1] is 2 since nums[1] and nums[2] are divisible by 3.
The divisibility score of divisors[2] is 0 since none of the numbers in nums is divisible by 7.
The divisibility score of divisors[3] is 2 since nums[0] and nums[3] are divisible by 2.
As divisors[0], divisors[1], and divisors[3] have the same divisibility score, we return the smaller one which is divisors[3].
Example 2:
Input: nums = [4,7,9,3,9], divisors = [5,2,3]
Output: 3
Explanation:
The divisibility score of divisors[0] is 0 since none of numbers in nums is divisible by 5.
The divisibility score of divisors[1] is 1 since only nums[0] is divisible by 2.
The divisibility score of divisors[2] is 3 since nums[2], nums[3] and nums[4] are divisible by 3.
Input: nums = [20,14,21,10], divisors = [10,16,20]
Output: 10
Explanation:
The divisibility score of divisors[0] is 2 since nums[0] and nums[3] are divisible by 10.
The divisibility score of divisors[1] is 0 since none of the numbers in nums is divisible by 16.
The divisibility score of divisors[2] is 1 since nums[0] is divisible by 20.
Time Complexity: O(|\texttt{nums}||\texttt{divisors}|)
Space Complexity: O(1)
2644. Find the Maximum Divisibility Score LeetCode Solution in C++
class Solution {
public:
int maxDivScore(vector<int>& nums, vector<int>& divisors) {
int ans = -1;
int maxScore = -1;
for (const int divisor : divisors) {
const int score = ranges::count_if(
nums, [divisor](const int num) { return num % divisor == 0; });
if (score > maxScore) {
ans = divisor;
maxScore = score;
} else if (score == maxScore) {
ans = min(ans, divisor);
}
}
return ans;
}
}; /* code provided by PROGIEZ */
2644. Find the Maximum Divisibility Score LeetCode Solution in Java
class Solution {
public int maxDivScore(int[] nums, int[] divisors) {
int ans = -1;
int maxScore = -1;
for (final int divisor : divisors) {
final int score = (int) Arrays.stream(nums).filter(num -> num % divisor == 0).count();
if (score > maxScore) {
ans = divisor;
maxScore = score;
} else if (score == maxScore) {
ans = Math.min(ans, divisor);
}
}
return ans;
}
} // code provided by PROGIEZ
2644. Find the Maximum Divisibility Score LeetCode Solution in Python
class Solution:
def maxDivScore(self, nums: list[int], divisors: list[int]) -> int:
ans = -1
maxScore = -1
for divisor in divisors:
score = sum([1 for num in nums if num % divisor == 0])
if score > maxScore:
ans = divisor
maxScore = score
elif score == maxScore:
ans = min(ans, divisor)
return ans # code by PROGIEZ
