## Sum of all N digit palindrome numbers

Given a number N. The task is to find the sum of all N digit palindromes. Examples: Input: N = 2 Output: 495 Explanation: 11… Read More »

- Sum of digits with even number of 1's in their binary representation
- Reduce number to a single digit by subtracting adjacent digits repeatedly
- Equal Sum and XOR of three Numbers
- Count of integers in a range which have even number of odd digits and odd number of even digits
- Recursive program to find all Indices of a Number
- Find two integers A and B such that A ^ N = A + N and B ^ N = B + N
- First N terms whose sum of digits is a multiple of 10
- Generate N integers satisfying the given conditions
- Find the maximum sum of digits of the product of two numbers
- Count number of bits to be flipped to convert A to B | Set-2
- Maximum number of region in which N non-parallel lines can divide a plane
- Nambiar Number Generator
- Convert N to M with given operations using dynamic programming
- Program to find first N Fermat Numbers
- Probability that a N digit number is palindrome
- Triangle of numbers arising from Gilbreath's conjecture
- Find number of factors of N when location of its two factors whose product is N is given
- Nth Fibonacci number using Pell's equation
- Find the previous fibonacci number
- Maximum value of division of two numbers in an Array
- Count of N-bit binary numbers without leading zeros
- Reverse bytes of a Hexadecimal Number
- Euler zigzag numbers ( Alternating Permutation )
- Check if the number is valid when flipped upside down
- Find the average of k digits from the beginning and l digits from the end of the given number
- Check whether the given integers a, b, c and d are in proportion
- Program to find Nth odd Fibonacci Number
- Random list of M non-negative integers whose sum is N
- Sum of all the numbers present at given level in Pascal's triangle
- Sum of two numbers if the original ratio and new ratio obtained by adding a given number to each number is given

Given a number N. The task is to find the sum of all N digit palindromes. Examples: Input: N = 2 Output: 495 Explanation: 11… Read More »

Given two numbers n and m, the task is to find the minimum number of operations required to make them equal if the following operations… Read More »

Given a sum S and an integer N, The task is to remove two consecutive integers from 1 to N to make sum equal to… Read More »

Given a number N, the task is to find two composite numbers X and Y, such that difference between them is equal to N. Note… Read More »

Given an integer N, the task is to check whether the sum of digits of N is palindrome or not. Example: Input: N = 56… Read More »

Given a large integer N, the task is to find all the possible remainders when N is divided by all the positive integers from 1… Read More »

Given a number n, the task is to determine whether n can be a factorial of some number x Examples: Input: N = 24 Output:… Read More »

Given the pointers to the head nodes of two linked lists. The task is to compare the numbers represented by the linked lists. The numbers… Read More »

Given a string S consisting of a large hexadecimal number, the task is to check its divisibility by a given decimal number M. If divisible… Read More »

Given a number N, the task is to clear the K-th bit of this number N. If K-th bit is 0, then set it to… Read More »

Given a number N, the task is to clear the K-th bit of this number N. If K-th bit is 1, then clear it to… Read More »

Given an integer N and an infinite table where ith row and jth column contains the value i *j. The task is to find the… Read More »

Given a floating point number N, the task is to check whether it is palindrome or not. Input: N = 123.321 Output: Yes Input: N… Read More »

Given four integers a, b, c and d. The task is to check whether it is possible to pair them up such that they are… Read More »

Given a Fibonacci number N, the task is to find the previous Fibonacci number. Examples: Input: N = 8 Output: 5 5 is the previous… Read More »