## Check if product of digits of a number at even and odd places is equal

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 »

- Program to find the last two digits of x^y
- Reduce number to a single digit by subtracting adjacent digits repeatedly
- Append a digit in the end to make the number equal to the length of the remaining string
- Count of integers in a range which have even number of odd digits and odd number of even digits
- Check if the sum of digits of number is divisible by all of its digits
- Round the given number to nearest multiple of 10 | Set-2
- Maximum number formed from array with K number of adjacent swaps allowed
- First N terms whose sum of digits is a multiple of 10
- Find the maximum sum of digits of the product of two numbers
- Largest and smallest digit of a number
- Nearest greater number by interchanging the digits
- Find the smallest positive number which can not be represented by given digits
- Reduce N to 1 with minimum number of given operations
- Count the number of occurrences of a particular digit in a number
- Sum of the digits of square of the given number which has only 1's as its digits
- Find the first N integers such that the sum of their digits is equal to 10
- Sum of last digit of all integers from 1 to N divisible by M
- Find the remainder when First digit of a number is divided by its Last digit
- Minimum possible number with the given operation
- Check if two Integer are anagrams of each other
- Count of matchsticks required to represent the given number
- Find the largest number that can be formed by changing at most K digits

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 »

Given two positive integers N and M, the task is to find the smallest positive integer which is divisible by N and whose digit sum… Read More »

Given two positive integers N and M. The task is to find M-th number whose sum of digits of a number until sum becomes single… Read More »

Given two integers N and X. The task is to print the absolute difference between the first X and last X digits in N. Considering… Read More »

Given three integer n, m and k, the task is to find the smallest integer > n such that digit m appears exactly k times… Read More »

Given two integers a and b. Now, c can be found as a + b = c. The task is to check if the equation… Read More »

Given an integer N, the task is to check whether the number is divisible by the sum of its digits or not. If divisible, then… Read More »

Given an integer num, the task is to count the number of holes in that number. The holes in each digit are given below: Digit… Read More »

Given an integer N where . The task is to check whether the number is not divisible by any of its digit. If the given… Read More »