## Program to check the number is Palindrome or not

Given an integer N, write a program that returns true if the given number is a palindrome, else return false. Examples: Input: N = 2002… Read More »

- Program to find the last two digits of x^y
- Nth number whose sum of digit is multiple of 10
- 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
- Count the number of digits of palindrome numbers in an array
- Check if two numbers have same number of digits
- Reduce N to 1 with minimum number of given operations
- Count the number of occurrences of a particular digit in a number
- Count the nodes in the given tree whose sum of digits of weight is odd
- 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, write a program that returns true if the given number is a palindrome, else return false. Examples: Input: N = 2002… Read More »

Given a range represented by two positive integers L and R. Find the count of numbers in the range where the first digit is equal… Read More »

Given two integer m and n, the task is to find the sum of distinct digits of both the numbers and print YES if the… Read More »

Given two integer L and R representing a range [L, R], the task is to find the count of integers from the range that are… Read More »

Given two integer N and D, the task is to find the sum of all the integers from 1 to N whose unit digit is… Read More »

Given two positive integers N and K. Find the minimum number of digits that can be removed from the number N such that after removals… Read More »

Given an integer n, the task is to check whether n is in binary or not. Print true if n is the binary representation else… Read More »

Given an integer N, the task is to find the greatest number less than N such that the sum of its digits is greater than… Read More »

Given a number N, the task is to find the required numbers consist of only 0 and 1 digit whose sum is equal to N.… Read More »

Given a number N. The task is to find first N Iccanobif Numbers. Iccanobif Numbers are similar to Fibonacci Numbers. The K-th Iccanobif number can… Read More »

Given three integers A, B and N, repeat the following process N times: Add a digit to A such that after adding it, A is… Read More »

Given an integer N, the task is to find the Nth number made up of odd digits (1, 3, 5, 7, 9) only. First few… Read More »

Given a number N. The task is to find the count of numbers which have N digits and even number of zeroes. Note: The number… Read More »

Given two arrays arr1[] and arr2[]. The task is to find the total number of distinct pairs(formed by picking 1 element from arr1 and one… Read More »

Given a number . The task is to check if the number is formed by concatenating the numbers 1, 14 and 144 only any number… Read More »