Tag Archives: GCD-LCM

Given two positive integers K and X, the task is to find the minimum possible sum of K positive integers ( repetitions allowed ) having… Read More
Given two numbers. The task is to find the GCD of the two numbers. Using STL : In Python, the math module contains a number… Read More
Given two integers X and Y, the task is to check if it is possible to reach (X, Y) from (1, 1) by the following… Read More
Given two numbers A and B, the task is to find the minimum number that needs to be added to A and B such that… Read More
Given an array arr[] of N integers and a positive integer K, the task is to check if it is possible to split this array… Read More
Given an array A[] consisting of N positive integers, the task is to check if all the array elements are pairwise co-prime, i.e. for all… Read More
Given an array arr[] of size N, the task is to split the entire array into a minimum number of subarrays such that for each… Read More
Given an array arr[] of N positive integers. The task is to find the length of the shortest sub-sequence such that the GCD of the… Read More
Given a number N, the task is to find the largest power of 2 that divides LCM of first N Natural numbers. Examples: Input: N… Read More
Given a number N, the task is to find two numbers a and b such that a + b = N and LCM(a, b) is… Read More
Given an array of string arr[], the task is the Greatest Common Divisor of the given array of string.  In strings ‘A’ and ‘B’, we… Read More
Given an integer N (> 2), the task is to find the maximum GCD among all pairs possible by the integers in the range [1,… Read More
Given an integer N, the task is to find the count of all possible pairs of integers (A, B) such that GCD (A, B) +… Read More
Given an integer N, the task is to find the count of all possible integers less than N satisfying the following properties: The number is… Read More
Given a Binary Tree, the task is to find the maximum value of GCD from any path from the root node to the leaf node.… Read More