Minimal Distinction between multiples of three integers

Given three integers X, Y, and Z. the duty is to search out the minimal distance between any two multiples of the given integers.

Observe: Widespread multiples should not thought of. 

Examples:

Enter: X = 5, Y = 2, Z = 3
Output: 1
Clarification: The multiples if organized in sorted order are 0, 2, 3, 4, 5, 6, 8. . . 
Out of which the minimal doable distinction is 1 between 2 and three.

Enter: X = 3, Y = 6, Z = 12
Output: 3

Strategy: To unravel the issue observe the under concept:

• Distinction between the multiples of two numbers A and B is definitely the multiples of GCD(A, B).
• To calculate the minimal doable distinction between the a number of of any two numbers, calculate the GCD of these two numbers.

Comply with the given steps to unravel the issue:

• Calculate the best frequent divisor(GCD) between each pair of numbers.
• Return the minimal worth by evaluating the values calculated within the above step.

Under is the implementation for the above strategy:

Time Complexity: O(max(logX, logY, logZ))
Auxiliary Area: O(1)