Given two numbers A and B, the task is to calculate GCD of A and B. Examples: Input : A = 4, B = 6 Output : 2 Input : A = 5, B = 10 Output : 5 GCD (Greatest Common Divisor) of two number is the largest number that divides both of them. A simple solution… Read More »
Given an array of size n, your task is to find the least common multiple or LCM of all the elements of the array. Examples: Input : arr = [ 8, 9, 21] Output : 504 Input : arr = [ 2, 4, 3, 8] Output : 24 RECOMMENDED: Maximum Length Subsequence from Ticket Prices Array Method-1: Prime… Read More »
Given first N natural numbers. Our task is to check whether is it possible to split the numbers in two sets such that absolute difference of the sum of numbers in the two sets is equal to M and their gcd(greatest common divisor) is 1. Examples: Input : 5 7 Output : Yes Here,N=5 and M=7 Total sum… Read More »
Given an array (with all elements greater than 0), create a non-decreasing array by swapping 2 elements if their gcd(Greatest Common Factor) is equal to the minimum element of the array. You have to print “YES” if this is possible, and if not print “NO”. Examples: Input: a[] = {6,2,4,8,12} Output: YES Explaination: Swap a[1] and a[2] and… Read More »
