## Minimum cuts required to divide the Circle into equal parts

Given an array arr which represents the different angles at which a circle is cut, the task is to determine the minimum number of more… Read More »

- Reach the numbers by making jumps of two given lengths
- Make Binary Search Tree
- Number of array elements derivable from D after performing certain operations
- Smallest perfect square divisible by all elements of an array
- Find three integers less than or equal to N such that their LCM is maximum
- Program to find Nth term divisible by a or b
- Program to find LCM of two Fibonnaci Numbers
- Minimum sum of the elements of an array after subtracting smaller elements from larger
- Sum of LCM(1, n), LCM(2, n), LCM(3, n), ... , LCM(n, n)
- Sum of common divisors of two numbers A and B
- Count of common multiples of two numbers in a range
- Find an integer X which is divisor of all except exactly one element in an array
- Count numbers in a range that are divisible by all array elements
- LCM of N numbers modulo M
- Count numbers in a range having GCD of powers of prime factors equal to 1
- Maximum GCD of N integers with given product
- LCM and HCF of fractions
- Time taken by two persons to meet on a circular track
- Count common prime factors of two numbers
- Count number of sub-sequences with GCD 1
- Largest N digit number divisible by given three numbers
- Maximum length subarray with LCM equal to product
- Find two numbers whose sum and GCD are given
- GCD of a number raised to some power and another number
- Minimum value that divides one number and divisible by other
- Find the winner by adding Pairwise difference of elements in the array until Possible
- Divide the two given numbers by their common divisors
- Minimum cuts required to divide the Circle into equal parts
- Check if there is any pair in a given range with GCD is divisible by k
- All possible co-prime distinct element pairs within a range [L, R]

Given an array arr which represents the different angles at which a circle is cut, the task is to determine the minimum number of more… Read More »

Given three numbers a, b, n. Find GCD(an, b). Examples: Input : a = 2, b = 3, n = 3 Output : 1 2^3… Read More »

Given four integers x, y, z and n, the task is to find the largest n digit number which is divisible by x, y and… Read More »

Given a rectangular sheet of length l and width w. we need to divide this sheet in the square sheets such that the number of… Read More »

Given a range, we need to check if is their any pairs in the segment whose GCD is divisible by k. Examples: Input : l=4,… Read More »

Given two integers and . The task is to find the Nth term which is divisible by either of or . Examples : Input :… Read More »

You are given an array of N integer values and M update operations. An update consists of choosing an element of the array and dividing… Read More »

Given a set containing N elements, you are allowed to add an element Z > 0 to this set only if it can be represented… Read More »

Given a range from L to R and every Xth tile is painted black and every Yth tile is painted white in that range from… Read More »

Given a range [L, R], the task is to find all possible co-prime pairs from the range such that an element doesn’t appear in more… Read More »

Given a number , find the number of distinct integers obtained by lcm(X, N)/X where X can be any positive number. Examples: Input: N =… Read More »

Given N and K, the task is to print N lines where each line contains 4 numbers such that every among those 4 numbers has… Read More »

Given two numbers n, r ( n>=r ). The task is to find the value of C(n, r) for big value of n. Examples: Input:… Read More »

Given a number N. The task is to find the number of co-prime pairs (a, b) from 1 to N such that their product(a*b) is… Read More »

Given indices of N Fibonacci numbers. The task is to find the GCD of the Fibonacci numbers present at the given indices. The first few… Read More »