Grokking the Art of Recursion for Coding Interviews

0% completed

​
3. Greatest Common Divisor (GCD)

Problem Statement

Write recursive code to calculate the Greatest Common Divisor (GCD) of Two Positive Numbers.

The greatest common divisor (GCD) of two positive integers A and B is the largest positive integer that divides both A and B without leaving a remainder.

Let's see some example inputs/outputs for this example:

| Input(s) | Output(s) | Explanation |

.....

.....

.....

Like the course? Get enrolled and start learning!