## Minimum number of given moves required to make N divisible by 25

Given a number N(1 ≤ N ≤ 1018) without leading zeros. The task is to find the minimum number of moves required to make N… Read More »

- Sum of the multiples of two numbers below N
- Remove characters from a numeric string such that string becomes divisible by 8
- Generating numbers that are divisor of their right-rotations
- Smallest perfect square divisible by all elements of an array
- Program to find Nth term divisible by a or b
- Count of sub-sets of size n with total element sum divisible by 3
- Count of sub-strings that are divisible by K
- Check if a large number is divisible by 2, 3 and 5 or not
- Split a number into 3 parts such that none of the parts is divisible by 3
- Minimum number of operations required to reduce N to 1
- Check if the sum of perfect squares in an array is divisible by x
- Minimum removals in a number to be divisible by 10 power raised to K
- Find minimum x such that (x % k) * (x / k) == n
- Sum of common divisors of two numbers A and B
- Longest subarray with elements divisible by k
- Find the multiple of x which is closest to a^b
- Highest power of two that divides a given number
- Possible cuts of a number such that maximum parts are divisible by 3
- Smallest integer > 1 which divides every element of the given array
- Minimum positive integer divisible by C and is not in range [A, B]
- Largest Divisor of a Number not divisible by a perfect square
- Sum of first N natural numbers which are divisible by 2 and 7
- Smallest multiple of 3 which consists of three given non-zero digits
- Minimum and Maximum element of an array which is divisible by a given number k
- Number of divisors of a given number N which are divisible by K
- Maximum count of equal numbers in an array after performing given operations
- Program to find remainder when large number is divided by r
- Find all numbers that divide maximum array elements
- Largest number with the given set of N digits that is divisible by 2, 3 and 5
- Minimum value that divides one number and divisible by other

Given a number N(1 ≤ N ≤ 1018) without leading zeros. The task is to find the minimum number of moves required to make N… Read More »

Given an integer n and a range [l, r], the task is to find the count of total sub-sets of size n with integers from… Read More »

Given an integer n. The task is to count the number of operations required to reduce n to 0. In every operation, n can be… Read More »

Given three positive integers A, B and C. The task is to find the minimum integer X > 0 such that: X % C =… Read More »

Given a non-negative integer represented in the form of a numeric string str. Remove zero or more characters from the string such that the number… Read More »

Given an integer K and a numeric string str (all the characters are from the range [‘0’, ‘9’]). The task is to count the number… Read More »

Given an array arr[], the task is to find the smallest perfect square which is divisible by all the elements of the given array. Examples:… Read More »

Given a Large number N ( number of digits in N can be up to 105). The task is to find the cuts required of… Read More »

Given three non-zero digits 0 < A, B, C < 9. The task is to find the smallest number divisible by 3 all of whose… Read More »

Given two positive integers n and k. Find minimum positive integer x such that the (x % k) * (x / k) == n, where… Read More »

Given two integer p and q, the task is to find the minimum possible number x such that q % x = 0 and x… Read More »

You are given a number ‘N’. Your task is to split this number into 3 positive integers x, y and z, such that their sum… Read More »

Given two positive integers N and K. Find the minimum number of digits that can be removed from the number N such that after removals… Read More »

Given an array arr[] and an integer x, the task is to check whether the sum of all the perfect squares from the array is… Read More »