## Count of numbers whose sum of increasing powers of digits is equal to the number itself

Given an integer N, the task is to count all the integers less than or equal to N that follow the property where the sum… 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 count all the integers less than or equal to N that follow the property where the sum… Read More »

Given an array arr[] of N positive elements, the task is to find a pair in the array such that the digit sum of elements… Read More »

Given an integer N, the task is to reduce the number to a smallest positive integer X after removing some of the digits (possibly none)… Read More »

Given an integer N, the task is to find two positive integers A and B such that A + B = N and the sum… Read More »

Given two integer A and B, the task is to check whether the binary representation of B can be generated by permuting the binary digits… Read More »

Given a number N, the task is to minimize the number by changing at most K digits. Note that the number should not contain any… Read More »

Given Q queries and an integer K where each query consists of a range [L, R] and the task is to find the count of… Read More »

Given three integers P, Q and N where P < Q, the task is to compute the fraction value of P / Q and find… Read More »

Given a positive integer X and Y, the task is to find the last digit of X in the given base Y. Examples: Input: X… Read More »

Given an integer N where 1 ≤ N ≤ 105, the task is to find the number of positive integers less than or equal to… Read More »

Given an integer N, the task is to find the count of natural Hexadecimal numbers with N digits. Examples: Input: N = 1 Output: 15… Read More »

Given an integer N, the task is to find the largest even and odd N-digit numbers in Octal Number System. Examples: Input: N = 4… Read More »

Given a large integer as a string str, the task is find the number of matchsticks required to represent it. Examples: Input: str = “56”… Read More »

Given a positive integer N, the task is to convert this integer to the minimum possible integer without leading zeroes by changing the digits. A… Read More »

Given an integer N, the task is to reduce N to 1 with the following two operations: 1 can be subtracted from each of the… Read More »