Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for The Greatest Common Divisor by suic
const gcd = (a: number, b: number): number => b === 0 ? a : gcd(b, a % b)
function greatestCommonDivisor(...args: number[]): number {
return args.reduce(gcd)
}
Dec. 3, 2020
Comments: