Greatest Common Divisor

Given 2 non negative integers m and n, find gcd(m, n)

GCD of 2 integers m and n is defined as the greatest integer g such that g is a divisor of both m and n.
Both m and n fit in a 32 bit signed integer.

Example

m : 6
n : 9

GCD(m, n) : 3 

NOTE : DO NOT USE LIBRARY FUNCTIONS

Interview Code Editor
Hints
  • Hint 1
  • Solution Approach
  • Complete Solution
11731 successful submissions.
Asked In:
  • NetApp
  • Google
Click here to jump start your coding interview preparation