## N digit numbers divisible by 5 formed from the M digits

Given M unique digits and a number N. The task is to find the number of N-digit numbers which can be formed from the given… Read More »

- Nth number whose sum of digit is multiple of 10
- Append a digit in the end to make the number equal to the length of the remaining string
- Smallest integer with digit sum M and multiple of N
- Find the longest subsequence of an array having LCM at most K
- Program to calculate product of digits of a number
- Sort the numbers according to their sum of digits
- Find the sum of digits of a number at even and odd places
- Find the number of solutions to the given equation
- Minimum number of given moves required to make N divisible by 25
- Check if product of digits of a number at even and odd places is equal
- Longest subarray such that adjacent elements have at least one common digit | Set - 2
- Sum of two numbers where one number is represented as array of digits
- Find M-th number whose repeated sum of digits of a number is N
- Smallest integer greater than n such that it consists of digit m exactly k times
- Find Nth positive number whose digital root is X
- Check if two numbers have same number of digits
- Absolute difference between the first X and last X Digits of N
- Find the count of numbers that can be formed using digits 3, 4 only and having length at max N.
- Numbers in a Range with given Digital Root
- Maximum number formed from array with K number of adjacent swaps allowed
- Count the nodes in the given tree whose sum of digits of weight is odd
- Count the number of digits of palindrome numbers in an array
- Maximum number that can be display on Seven Segment Display using N segments
- Greatest number less than equal to B that can be formed from the digits of A
- Check if a + b = c is valid after removing all zeroes from a, b and c
- Third last digit in 5^N for given N
- Largest and smallest digit of a number
- Composite numbers with digit sum 1

Given M unique digits and a number N. The task is to find the number of N-digit numbers which can be formed from the given… Read More »

Given a number N, the task is to check if xor value of the frequency of the digits is zero or not. Examples: Input: N… Read More »

Given a number N, the task is to check whether the product of digits at even places of a number is divisible by K. If… Read More »

Given two integer ‘N’ and ‘K’, the task is to find the sum of digits of ‘N’ at it’s odd places (right to left) and… Read More »

Given an integer ‘n’, the task is to check whether the sum of digits at the odd positions (from right to left) is prime or… Read More »

Given a number print the immediate smallest number formed by re-arranging the digits of a given number. Print “Not Possible” if it is not possible… Read More »

Given a number check whether it is a mystery number or not. A mystery number is that number which can be expressed as sum of… Read More »

Given a number represented in the form of an array such that each element of the array stores a single digit of the number. That… Read More »

Given two positive integers L and R (represented as strings) where . The task is to find the total number of super-palindromes in the inclusive… Read More »

Given two numbers A and B, A<=B, the task is to find the number of unary numbers between A and B, both inclusive. Unary Number:… Read More »

Given number of digits ‘N’ and base ‘B’, the task is to count all the ‘N’ digit numbers without leading zeros that are in base… Read More »

Given a digital root ‘D’ and number of digits ‘K’. The task is to print a number containing K digits that has its digital root… Read More »

Given a Hexadecimal number as an input, the task is to convert that number to Binary number. Examples: Input: Hexadecimal = 1AC5 Output: Binary =… Read More »

Given an array containing N elements. Each element is either 0 or 5. Find the largest number divisible by 90 that can be made using… Read More »

Given a number N, the task is to find unit and tens places digit of the first N natural numbers factorials, i.e last last two… Read More »