## Queries for count of even digit sum elements in given range using MO’s Algorithm

Given an array arr[] of N elements, the task is to answer Q queries each having two integers L and R. For each query, the… Read More »

- Find XOR of all elements in an Array
- Check whether a number can be represented as difference of two squares
- Digital Root of a given large integer using Recursion
- C Program to Print all digits of a given number
- Largest number possible after removal of K digits
- Count numbers in a range with digit sum divisible by K having first and last digit different
- Find the maximum Even Digit Sum node in the given tree
- Count of N digit Numbers whose sum of every K consecutive digits is equal
- Count of numbers upto N having absolute difference of at most K between any two adjacent digits
- Program to print the given digit in words
- Maximize product of digit sum of consecutive pairs in a subsequence of length K
- Array Range Queries to find the Maximum Armstrong number with updates
- Find a N-digit number such that it is not divisible by any of its digits
- Sum and Product of all even digit sum Nodes of a Singly Linked List
- Smallest number containing all possible N length permutations using digits 0 to D
- Count of N-digit numbers with absolute difference of adjacent digits not exceeding K | Set 2
- Find all Autobiographical Numbers with given number of digits
- Count of unique digits in a given number N
- Maximise the sum of two Numbers using at most one swap between them
- Find position of given term in a series formed with only digits 4 and 7 allowed
- GCD of elements occurring Fibonacci number of times in an Array
- How to check if string contains only digits in Java
- Find numbers that divide X and Y to produce the same remainder
- Sum of all N digit palindromic numbers divisible by 9 formed using digits 1 to 9
- Print all numbers in given range having digits in strictly increasing order
- Find smallest possible Number from a given large Number with same count of digits
- Count of N-digit numbers with absolute difference of adjacent digits not exceeding K
- Queries for count of even digit sum elements in given range using MO's Algorithm
- Find last digit in factorial
- Count of perfect squares of given length

Given an array arr[] of N elements, the task is to answer Q queries each having two integers L and R. For each query, the… Read More »

Given an array arr[] consisting of N elements and Q queries represented by L and R denoting a range, the task is to print the… Read More »

Given a number N, the task is to check if the given number and all its digits are Fibonacci. If so, then the given number… Read More »

Given two integers N and D, the task is to find the value of F(N) where the value of F(1) is D, where F(K) is… Read More »

Given an integer N, check whether the given number is a Moran Number or not. Moran numbers are a subset of Harshad numbers. A number… Read More »

Given two integers L and R, the task is to find the cumulative product of digits (i.e. product of the product of digits) of all… Read More »

Given two integers N and K, the task is to print the number formed by adding product of its max and min digit, K times.… Read More »

Given a number N, the task is to find the digit of the given number N. If the number has two middle digits then print… Read More »

Given a tree with the weights of all the nodes, the task is to find the maximum weighing node whose weight has even digit sum.… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: maximum(start, end): Print the maximum Armstrong number of elements… Read More »

Given an integer N, the task is to find the number of perfect squares of length N. Examples: Input: N = 1 Output: 3 Explanation:… Read More »

The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. Using a… Read More »

Given two integers X and Y, the task is to find the smallest number greater than or equal to X whose sum of digits is… Read More »

Given an array arr[], the task is to find the largest number that can be formed from a pair in the given array. Examples: Input:… Read More »

Given a Doubly linked list containing N nodes, the task is to remove all the nodes from the list which contains elements whose digit sum… Read More »