Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
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 1979. Find Greatest Common Divisor of Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source