2106. Find Greatest Common Divisor of Array
My accepted Python solution to LeetCode problem 2106, Find Greatest Common Divisor of Array, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.4MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.4MB, accepted 2025-12-29.
class Solution:
def findGCD(self, nums: List[int]) -> int:
# Find GCD of min and max elements
# Time: O(n + log(min(a,b))), Space: O(1)
from math import gcd
return gcd(min(nums), max(nums))