## Count of N-digit numbers with all distinct digits

Given an integer N, the task is to find the count of N-digit numbers with all distinct digits. Examples: Input: N = 1 Output: 9… Read More »

- Check whether N is a Factorion or not
- Count of N digit numbers possible which satisfy the given conditions
- Find sum of factorials in an array
- Factorial of an Array of integers
- Find the count of M character words which have at least one character repeated
- Count permutation such that sequence is non decreasing
- Number of words that can be made using exactly P consonants and Q vowels from the given string
- Find the number of strings formed using distinct characters of a given string
- Calculate MDAS Factorial of given number
- Queries for the product of first N factorials
- Euler zigzag numbers ( Alternating Permutation )
- Count of N-digit numbers with all distinct digits

Given an integer N, the task is to find the count of N-digit numbers with all distinct digits. Examples: Input: N = 1 Output: 9… Read More »

Given a string str and two integers P and Q. The task is to find the total count of words that can be formed by… Read More »

Given an integer N and the task is to check whether N is a Factorion or not. A Factorion is a number which is equal… Read More »

Given Q[] queries where each query consists of an integer N, the task is to find the product of first N factorials for each of… Read More »

Given a string str consisting of lowercase English alphabets, the task is to find the count of all possible string of maximum length that can… Read More »

Given an array arr[] of integers, the task is to find the count of permutation of the array such that the permutation is in increasing… Read More »

Euler Zigzag numbers is a sequence of integers which is a number of arrangements of those numbers so that each entry is alternately greater or… Read More »

Given an integer N, the Task is to find the total number of N digit numbers possible such that: All the digits of the numbers… Read More »

Given two integers N and M, the task is count the total words of M character length formed by the given N distinct characters such… Read More »

Given an integer N, the task is to find the MDAS factorial. The general factorial of a no. N is given by : Factorial(N) =… Read More »

Given an array with positive integers. The task is to find the factorial of all the array elements. Note: As the numbers would be very… Read More »

Given an array arr[] of N integers. The task is to find the sum of factorials of each element of the array. Examples: Input: arr[]… Read More »

Given two integers K and N, the task is to count the number of ways to arrange K different objects taking N objects at a… Read More »

Given an array arr[] which contains the frequency of the digits (0-9), the task is to find the count of numbers possible using each digit… Read More »

Given an integer N, the task is to check whether N divides the sum of the factorials of its digits. Examples: Input: N = 19… Read More »