# Find The Maximum Divisibility Score: Explained
Find The Maximum Divisibility Score shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The score of a divisor is how many nums it divides. Return the divisor with the highest score; ties go to the smaller divisor. Brute-force each divisor against nums.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(D * N).
## Common mistake
Breaking ties by choosing the larger divisor, or exiting early after the first perfect score.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob.ai.