## Generating numbers that are divisor of their right-rotations

Given a number m, find all numbers which have m digits and are a divisor of their right-rotation. Right-rotation of a number N is the… 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 a number m, find all numbers which have m digits and are a divisor of their right-rotation. Right-rotation of a number N is the… Read More »

Given a series of numbers composed only of digits 3 and 5. The first few numbers in the series are: 3, 5, 33, 35, 53,… Read More »

Given a number N. The task is to find the maximum possible value of SumOfDigits(A) + SumOfDigits(B) such that A + B = n (0<=A,… Read More »

Given a number N and a sum S, find the count of numbers upto N that have digit sum equal to S. Examples: Input :… Read More »

Given two numbers a and n, the task is to find the single sum of digits of a^n (pow(a, n)). In single digit sum, we… Read More »

Given a number N, the task is to print the maximum between the sum and multiplication of the digits of the given number until the… Read More »

Given a number x and two digits d1 and d2, replace d1 with d2 in x. Examples: Input : x = 645, d1 = 6,… Read More »

Given a number, the task is to quickly check if the number is divisible by 41 or not. Examples: Input : x = 123 Output… Read More »

Given a range, the task is to find the count of the numbers in the given range such that the sum of its digit is… Read More »

Given an array arr[] containing numbers from 0 to 9 only, the task is to form the minimum possible number from the given digits and… Read More »

Given two numbers sa and sb represented as strings, find ab % MOD where MOD is 1e9 + 7. The numbers a and b can… Read More »

Find the smallest palindrome number which is prime too and greater then given number N. Examples: Input : N = 7 Output :11 11 is… Read More »

Given a number N, you need to find a divisor of N such that the Digital Root of that divisor is the greatest among all… Read More »

Find the slope of the given number num. Slope of a number is the count of the minima and maxima digits in it. A digit… Read More »

Given a number, the task is to write a recursive function which checks if the given number is palindrome or not. Examples: Input : 121… Read More »