## Find the Largest divisor Subset in the Array

Given an array arr[] of N integers, the task is to find the largest subset of arr[] such that in every pair of numbers from… Read More »

## Number of subsets with sum divisible by M | Set 2

Given an array arr[] of N integers and an integer M, the task is to find the number of non-empty subsequences such that the sum… Read More »

## Maximum number of splits of a binary number

Given a binary string S, the task is to find the maximum number of parts that you can split it into such that every part… Read More »

## Count integers in the range [A, B] that are not divisible by C and D

Given four integers A, B, C and D. The task is to find the count of integers in the range [A, B] that are not… Read More »

## Count of Multiples of A ,B or C less than or equal to N

Given four integers N, A, B and C. The task is to find the count of integers from the range [1, N] which are divisible… Read More »

## Maximize profit when divisibility by two numbers have associated profits

Given five integers N, A, B, X and Y. The task is to find the maximum profit obtained from the numbers from the range [1,… Read More »

## Smallest integer > 1 which divides every element of the given array

Given an array arr[], the task is to find the smallest possible integer (other than 1) which divides every element of the given array. Examples:… Read More »

## Numbers that are not divisible by any number in the range [2, 10]

Given an integer N. The task is to find the count of all the numbers from 1 to N which are not divisible by any… Read More »

## Count numbers which are divisible by all the numbers from 2 to 10

Given an integer N, the task is to find the count of numbers from 1 to N which are divisible by all the numbers from… Read More »

## Minimum possible sum of array elements after performing the given operation

Given an array arr[] of positive integers and an integer x, the task is to minimize the sum of elements of the array after performing… Read More »

## 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 »

## Count of sub-sets of size n with total element sum divisible by 3

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 »

## Count operations of the given type required to reduce N to 0

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 »

## Minimum positive integer divisible by C and is not in range [A, B]

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

## Remove characters from a numeric string such that string becomes divisible by 8

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 »