## Largest number smaller than or equal to n and digits in non-decreasing order

Given a number n, find the Largest number smaller than or equal to n and digits in non-decreasing order. Examples: Input : n = 200… 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
- Find minimum possible digit sum after adding a number d
- 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
- Possible cuts of a number such that maximum parts are divisible by 3
- Sum of integers upto N with given unit digit
- 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

Given a number n, find the Largest number smaller than or equal to n and digits in non-decreasing order. Examples: Input : n = 200… Read More »

Given an integer n, the task is to check if frequency of each digit of the number is less than or equal to digit itself.… Read More »

Given a number, check whether a given number is divisible by 36 or not. The number may be very large and may not fit in… Read More »

Given a number, the task is to find if the number is divisible by 9 or not. The input number may be large and it… Read More »

Given an string of binary number n. Convert binary fractional n into it’s decimal equivalent. Exanples: Input: n = 110.101 Output: 6.625 Input: 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 number, the task is to check if a number is divisible by 6 or not. The input number may be large and it… Read More »

Given a integer represented as a string, we need to get the sum of all possible substrings of this string. Examples: Input : num =… Read More »

Given a number, the task is to check if a number is divisible by 8 or not. The input number may be large and it… Read More »

Given a string consisting of some numbers, not separated by any separator. The numbers are positive integers and the sequence increases by one at each… Read More »

Given a number, the task is to check if a number is divisible by 4 or not. The input number may be large and it… Read More »

Given a number, the task is that we divide number by 3. The input number may be large and it may not be possible to… Read More »

Given a number, the task is to check if the number is divisible by 11 or not. The input number may be large and it… Read More »

A Seed of a number n is a number x such that multiplication of x with its digits is equal to n. The task is… Read More »

Given a limit N, we need to find out the count of binary digit numbers which are smaller than N. Binary digit numbers are those… Read More »