Available question text
Given arrays nums and divisors, compute for each divisor how many nums are divisible by it and return the divisor with the highest count (breaking ties by the smallest divisor). With lengths up to 1000, a straightforward O(n*m) scan counting divisibility for each divisor is sufficient.
Related questions
Continue with questions that share topics or the same question type.
- Find and Count Maximum-Score Grid Paths
Coding · Dynamic Programming · Grids & Matrices
- Find the Maximum Factor Score of Array
Coding
- Build Array Where You Can Find The Maximum Exactly K Comparisons
Coding
- Find Cutoff Score for Each School
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2644. Find the Maximum Divisibility Score
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source