# Find Greatest Common Divisor Of Array: Practice Notes
Find Greatest Common Divisor Of Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Return gcd of the minimum and maximum of nums (any common divisor of all elements divides both min and max, and gcd(min,max) divides every integer combination). One pass for min/max, then Euclidean gcd.
## 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 + log A).
## Common mistake
Computing gcd of the whole array unnecessarily, or returning min itself without taking gcd with max.
## 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 multilingual AI interview assistant.