The Euclidean algorithm, also called Euclid’s algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b.
ChocolatesByNumbers
There are N chocolates in a circle. Count the number of chocolates you will eat.
Difficulty Level: Easy
CommonPrimeDivisors
Check whether two numbers have the same prime divisors.
Difficulty Level: Medium