## Total no of 1’s in numbers

Given an integer n, count the total number of digit 1 appearing in all positive integers less than or equal to n. Examples: Input :… Read More »

- Generate all rotations of a number
- Check if a number is a Mystery Number
- Immediate smallest number after re-arranging the digits of a given number
- Count distinct pairs from two arrays having same sum of digits
- Program to Convert Hexadecimal Number to Binary
- Program to check the number is Palindrome or not
- Generating numbers that are divisor of their right-rotations
- Count of Numbers in Range where first digit is equal to last digit of the number
- Program for replacing one digit with other
- Maximum sum and product of the M consecutive digits in a number
- Count the number of holes in an integer
- Program to delete Nth digit of a Number
- Count numbers (smaller than or equal to N) with given digit sum
- Largest number less than N with digit sum greater than the digit sum of N
- Minimum removals in a number to be divisible by 10 power raised to K
- Count Unary Numbers in a Range
- Find minimum possible digit sum after adding a number d
- Print a number strictly less than a given number such that all its digits are distinct.
- Integers from the range that are composed of a single distinct digit
- Program to find first N Iccanobif Numbers
- Program to find the N-th term of series 3, 5, 33, 35, 53…. | Set-2
- Sum of integers upto N with given unit digit
- Program to check if a number is divisible by any of its digits
- Possible cuts of a number such that maximum parts are divisible by 3
- Print numbers with digits 0 and 1 only such that their sum is N
- Nth number made up of odd digits only
- Largest N digit number divisible by given three numbers
- Count all palindrome which is square of a palindrome
- Sum and Product of digits in a number that divide the number
- Least Greater number with same digit sum

Given an integer n, count the total number of digit 1 appearing in all positive integers less than or equal to n. Examples: Input :… Read More »

Given a huge integer value n, find the largest integer value x such that x <= n and all the digits of x are prime.… Read More »

Given a non-negative number N in the form of string. The task is to apply at most one swap operation on the number N so… Read More »

An ISBN (International Standard Book Number) is a 10 digit number that is used to identify a book. The first nine digits of the ISBN… Read More »

A number is said to be a Peterson number if the sum of factorials of each digit of the number is equal to the number… Read More »

Given a number, we need to find the sum of all the digits of a number which we get after raising the number to a… Read More »

Given a number n, find how many n digit number can be formed that does not contain 9 as it’s digit. Examples: Input : 1… Read More »

Given a number n, we need to find the sum of each digits of the number till the number becomes a single digit. We need… Read More »

Given a number, check whether the product of digit sum and reverse of digit sum equals the number or not. Examples: Input : 1729 Output… Read More »

Given a number n, find a number in range from 1 to n such that its sum is maximum. If there are several such integers,… Read More »

Given a number n, find LCM of its digits. Examples: Input : 397 Output : 63 LCM of 3, 9 and 7 is 63. Input… Read More »

Given a very large number N (1 <= number of digit in N <= 105). The task is find the largest number X such that… Read More »

Given a positive number n. We need to find x such that 1*n, 2*n, 3*n…..x*n gives all 10 digits at least once. If no such… Read More »

Given a positive number n. We need to find a number x such that sum of digits of x to itself is equal to n.… Read More »

Given an number n, find the number of divisors whose at least one digit in the decimal representation matches with the number n. Examples: Input… Read More »