53. GCD (Euclidean)

Easy

Topics

Helpful tools to learn & understand

Visualize LogicActive Simulator

Watch key transitions, pointers, and variables update step-by-step.

Open

Check Solutions

Read clean, documented implementations across multiple patterns.

View Code

Thinkpad (Draw & Note)

Sketch diagrams on an infinite canvas and draft notes directly inline.

Draw

Example 1:

Input: a = 48, b = 18

Output: 6

Explanation: The greatest common divisor of 48 and 18 is 6.

Example 2:

Input: a = 12, b = 0

Output: 12

Explanation: When b is 0, the GCD is a.

Example 3:

Input: a = 0, b = 0

Output: 0

Explanation: When both a and b are 0, the GCD is defined as 0.

Example 4:

Input: a = 35, b = 15

Output: 5

Explanation: The greatest common divisor of 35 and 15 is 5.

Example 5:

Input: a = 1071, b = 462

Output: 21

Explanation: The greatest common divisor of 1071 and 462 is 21.

Constraints:

•
•

Time Complexity

O(log(min(a,b)))

Space Complexity

O(1)