Home Data Structures and Algorithms Medium Level Problems on GCD

Medium Level Problems on GCD

Easy Level Problems on GCD

Hard Level Problems on GCD

LCM of First n Natural Numbers
Given GCD G and LCM L, find number of possible pairs (a, b)
Count numbers in range 1 to N which are divisible by X but not by Y
Minimum possible final health of the last monster in a game
Find the maximum GCD of the siblings of a Binary Tree
Check if possible to move from given coordinate to desired coordinate
Program to find Greatest Common Divisor (GCD) of N strings
Largest subsequence having GCD greater than 1
Subsequence of size k with maximum possible GCD
Minimum gcd operations to make all array elements one
GCD of elements in a given range
Count pairs of natural numbers with GCD equal to given number
Maximum GCD of all subarrays of length at least 2
Queries for GCD of all numbers of an array except elements in a given range
Minimum operations required to make two numbers equal
GCD of two numbers formed by n repeating x and y times

GCD (Greatest Common Divisor) Practice Problems for Competitive Programming

GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest positive integer that divides both of the numbers.

GCD (Greatest Common Divisor)

Tags:

#GCD-LCM #DSA #Mathematical #Mathematical

Easy Level Problems on GCD

Hard Level Problems on GCD