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

- Generate all rotations of a number
- Immediate smallest number after re-arranging the digits of a given number
- Check if a number is a Mystery Number
- Program to Convert Hexadecimal Number to Binary
- Count distinct pairs from two arrays having same sum of digits
- Program to check the number is Palindrome or not
- Count of Numbers in Range where first digit is equal to last digit of the number
- Count the number of holes in an integer
- Maximum sum and product of the M consecutive digits in a number
- Program to delete Nth digit of a Number
- Largest number less than N with digit sum greater than the digit sum of N
- Sum and Product of digits in a number that divide the number
- Count Unary Numbers in a Range
- Minimum removals in a number to be divisible by 10 power raised to K
- Program to find first N Iccanobif Numbers
- Integers from the range that are composed of a single distinct digit
- Program to check if a number is divisible by any of its digits
- Sum of integers upto N with given unit digit
- Possible cuts of a number such that maximum parts are divisible by 3
- Program to check if a number is divisible by sum of its digits
- Nth number made up of odd digits only
- Print numbers with digits 0 and 1 only such that their sum is N
- Largest N digit number divisible by given three numbers
- Check whether product of digits at even places is divisible by sum of digits at odd place of a number
- Least Greater number with same digit sum
- Count all palindrome which is square of a palindrome
- Count Numbers with N digits which consists of even number of 0’s
- Find last two digits of sum of N factorials
- Smallest odd digits number not less than N
- Largest number not greater than N all the digits of which are odd

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 a range [L, R], the task is to find all the numbers from the range which are composite as well as the eventual sum… Read More »

Given two positive integers N and M, the task is to find the smallest positive integer which is divisible by N and whose digit sum… Read More »

Given two positive integers N and M. The task is to find M-th number whose sum of digits of a number until sum becomes single… Read More »

Given two integers N and X. The task is to print the absolute difference between the first X and last X digits in N. Considering… Read More »

Given three integer n, m and k, the task is to find the smallest integer > n such that digit m appears exactly k times… Read More »

Given two integers a and b. Now, c can be found as a + b = c. The task is to check if the equation… Read More »

Given an integer N, the task is to check whether the number is divisible by the sum of its digits or not. If divisible, then… Read More »

Given an integer num, the task is to count the number of holes in that number. The holes in each digit are given below: Digit… Read More »

Given an integer N where . The task is to check whether the number is not divisible by any of its digit. If the given… Read More »

Given a number num and a number n, the task is to delete this nth digit of the number num, from starting and from end.… 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 an integer N, the task is to find the product of N with its largest odd digit. If there is no odd digit in… Read More »

Given an integer n, the task is to generate all the left shift numbers possible. A left shift number is a number that is generated… Read More »

Given two integers a and b, the task is to add them to get c. After that remove zeroes from a, b and c and… Read More »