# Find The Number Of Good Pairs I: Practice Notes
Find The Number Of Good Pairs I shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A pair (i,j) is good if nums1[i] is divisible by nums2[j]*k. With small values, nested loops are fine; for larger ones, iterate multiples of (nums2[j]*k) up to max(nums1) via a frequency array.
## 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(n*m) or O(m * max/min).
## Common mistake
Checking nums2[j] divisible by nums1[i], which reverses the condition.
## 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 real-time interview help.