How should I practice Sum of Divisors of the Array GCD?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Zscaler phone screen problems in FastPrep.

Is Sum of Divisors of the Array GCD associated with Zscaler?

FastPrep tags this as a Zscaler phone screen coding practice problem when the problem catalog has that company and stage context.

Zscaler● EasyINTERNPHONE SCREEN

Given a nonempty array of positive integers values, compute the greatest common divisor of all values.

Return the sum of every positive divisor of that GCD.

sumDivisorsOfArrayGcd(values: int[]) → long

values = [6,12,18]return = 12

The array GCD is 6. Its positive divisors are 1, 2, 3, 6, whose sum is 12.

values = [7,14]return = 8

The GCD is 7, so the divisor sum is 1 + 7 = 8.

values = [8,16,32]return = 15

The GCD is 8. Its divisors 1, 2, 4, 8 sum to 15.