## Maximum and minimum sums from two numbers with digit replacements

Given two positive numbers calculate the minimum and maximum possible sums of two numbers. We are allowed to replace digit 5 with digit 6 and… 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
- 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
- Largest number not greater than N all the digits of which are odd

Given two positive numbers calculate the minimum and maximum possible sums of two numbers. We are allowed to replace digit 5 with digit 6 and… Read More »

Given a number (as string) and two integers a and b, divide the string in two non-empty parts such that the first part is divisible… Read More »

A Seven Segment Display can be used to to display numbers. Given an array of n natural numbers. The task is to find the number… Read More »

There are some natural number whose all permutation is greater than or equal to that number eg. 123, whose all the permutation (123, 231, 321)… Read More »

Given an interval, the task is to count numbers which have same first and last digits. For example, 1231 has same first and last digits.… Read More »

Given a range L to R, the task is to find the highest occurring digit in prime numbers lie between L and R (both inclusive).… Read More »

Find all numbers less than n, which are palindromic. Numbers can be printed in any order. Examples : Input : n = 12 Output :… Read More »

Given an array of digits (values are from 0 to 9), find the minimum possible sum of two numbers formed from digits of the array.… Read More »

Given a number N which may be 10^5 digits long, the task is to count all the digits in N which divide N. Divisibility by… Read More »

An integer number in base 10 which is divisible by sum of it digits is said to be a Harshad Number. An n-harshad number is… Read More »

A n digit number x is called Keith number if it appears in a special sequence (defined below) generated using its digits. The special sequence… Read More »

Find the Smallest number (Not leading Zeros) which can be obtained by rearranging the digits of given number. Examples: Input: n = 846903 Output: 304689… Read More »

Given n distinct digits (from 0 to 9), find sum of all n digit numbers that can be formed using these digits. It is assumed… Read More »

Given a string that contains digits of a number. The number may contain many same continuous digits in it. The task is to count number… Read More »

Given a number n, we need to find the sum of its digits such that: If n < 10 digSum(n) = n Else digSum(n) =… Read More »