Search
⌘K
Leetcode 1979. Find Greatest Common Divisor of Array
Return the greatest common divisor of the smallest and largest numbers in the array — the task reduces to finding min and max and computing their GCD (e.g., via the Euclidean algorithm), with nums length and values bounded by 1000.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.