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

- Remove characters from a numeric string such that string becomes divisible by 8
- Minimum possible sum of array elements after performing the given operation
- Count of sub-sets of size n with total element sum divisible by 3
- Count of sub-strings that are divisible by K
- Smallest integer > 1 which divides every element of the given array
- Minimum number of given moves required to make N divisible by 25
- Numbers that are not divisible by any number in the range [2, 10]
- Count operations of the given type required to reduce N to 0
- Minimum positive integer divisible by C and is not in range [A, B]
- Count numbers which are divisible by all the numbers from 2 to 10
- 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 »

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 »

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 »

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 »

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 »

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 »