## Find the sum of digits of a number at even and odd places

Given a number N, the task is to find the sum of digits of a number at even and odd places. Examples: Input: N =… Read More »

- Generate all rotations of a number
- Immediate smallest number after re-arranging the digits of a given number
- Program to Convert Hexadecimal Number to Binary
- Check if a number is a Mystery Number
- Program to check the number is Palindrome or not
- Count distinct pairs from two arrays having same sum of digits
- 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 the longest subsequence of an array having LCM at most K
- Program to find first N Iccanobif Numbers
- Program to check if a number is divisible by any of its digits
- Integers from the range that are composed of a single distinct digit
- Sum of integers upto N with given unit digit
- Possible cuts of a number such that maximum parts are divisible by 3
- Nth number made up of odd digits only
- Program to check if a number is divisible by sum of its digits
- Check whether product of digits at even places is divisible by sum of digits at odd place of a number
- Print numbers with digits 0 and 1 only such that their sum is N
- Sort the numbers according to their sum of digits
- Largest N digit number divisible by given three numbers
- Least Greater number with same digit sum
- Count all palindrome which is square of a palindrome
- Find the number of solutions to the given equation
- Find last two digits of sum of N factorials

Given a number N, the task is to find the sum of digits of a number at even and odd places. Examples: Input: N =… Read More »

Given a number, the task is to find the product of the digits of a number. Examples: Input: n = 4513 Output: 60 Input: n… Read More »

Given an array arr[] of N elements and a positive integer K. The task is to find the longest sub-sequence in the array having LCM… Read More »

Given an array arr[] of digits and an integer K, the task is to find num(arr) + K where num(arr) is the number formed by… Read More »

Given an array of N integers, the task is to find the length of the longest subarray such that adjacent elements of the subarray have… Read More »

Given a positive integer N. The task is to find the value of 3rd digit from last (right-most) of 5N. Examples: Input : N =… Read More »

Given a number N. Find the count of such numbers that can be formed using digits 3 and 4 only and having length at max… Read More »

Given two integers A and B, the task is to find the greatest number ≤ B that can be formed using all the digits of… Read More »

Given an integer N, the task is to check whether the product of digits at even and odd places of a number are equal. If… Read More »

Given an integer K and a range of consecutive numbers [L, R]. The task is to count the numbers from the given range which have… Read More »

Given a number X ( 1<= X <= 9) and a positive number N, find the Nth positive number whose digital root is X. Digital… Read More »

Given an array arr[] of N non-negative integers, the task is to sort these integers according to sum of their digits. Examples: Input: arr[] =… Read More »

Given three integers A, B and C, the task is to find the count of values of X such that the following condition is satisfied,… Read More »

Given a number N(1 ≤ N ≤ 1018) without leading zeros. The task is to find the minimum number of moves required to make N… Read More »

Given a range [L, R], the task is to find all the numbers from the range which are composite as well as the eventual sum… Read More »