Given three positive integers N, K, and M. The task is to find Kth largest N digit number divisible by M. Note: K will be… Read More

# Tag Archives: divisibility

Given a number N, the task is to find the minimum number of digits that needs to be removed from the number so that the… Read More

Given an array arr[] containing N positive integers and two variables L and R indicating a range of integers from L to R (inclusive). The… Read More

Given an array arr[] of N integers, the task is to find an integer X such that the integers that are divisible by X and… Read More

Given an integer N, find the minimum number of operations to reduce N to 1 by using the following two operations: Multiply N by 2… Read More

Given an array arr[]. The task is to create the smallest K digit number divisible by all numbers of arr[]. Examples: Input: arr[] = {2,… Read More

Given a large positive number as string, count all rotations of the given number which are divisible by 8. Examples: Input: 8 Output: 1 Input:… Read More

Given a large positive number as string, count all rotations of the given number which are divisible by 8. Examples: Input: 8 Output: 1 Input:… Read More

Given a large positive number as string, count all rotations of the given number which are divisible by 8. Examples: Input: 8 Output: 1 Input:… Read More

Given two integers N and K, the task is to calculate the minimum number of adjacent swaps of digits required to make the integer N… Read More

Given a large positive number as string, count all rotations of the given number which are divisible by 4. Examples: Input: 8 Output: 1 Input:… Read More

Given a large positive number as string, count all rotations of the given number which are divisible by 4. Examples: Input: 8 Output: 1 Input:… Read More

Given a large positive number as string, count all rotations of the given number which are divisible by 4. Examples: Input: 8 Output: 1 Input:… Read More