Practice Real Company Assessment Patterns • Latest 2025–2026 Mock Tests

Programming Exercises

Implement a program to find the GCD (Greatest Common Divisor) of two numbers using recursion.

Hard

Problem Statement

Implement a program to find the GCD (Greatest Common Divisor) of two numbers using recursion.

Sample Input

a = 48, b = 18

Sample Output

GCD = 6

Limits

Time: 2s · Memory: 256 MB

Code Editor
00:00
#include <stdio.h> int gcd(int a, int b); int main() { int a = 48, b = 18; // Logic to find GCD return 0; }
Log in or sign up to run or submit your code.Log inSign up
Input
a = 48, b = 18
Expected Output
GCD = 6