## Euler zigzag numbers ( Alternating Permutation )

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 »

- Program to calculate the value of nPr
- Number of ways to go from one point to another in a grid
- Check if factorial of N is divisible by the sum of squares of first N natural numbers
- Find GCD of factorial of elements of given array
- Number of ways to arrange K different objects taking N objects at a time
- Check whether factorial of N is divisible by sum of first N natural numbers
- Count of N digit numbers possible which satisfy the given conditions
- Count numbers having N 0's and and M 1's with no leading zeros
- Find the smallest number X such that X! contains at least Y trailing zeros.
- Factorial of an Array of integers
- Find sum of factorials in an array
- Find the count of M character words which have at least one character repeated
- Check if a given number divides the sum of the factorials of its digits
- Count different numbers possible using all the digits their frequency times
- Calculate MDAS Factorial of given number
- Euler zigzag numbers ( Alternating Permutation )

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 »

Given a number ‘N’. Check whether factorial of ‘N’ is divisible by the sum of first ‘N’ natural numbers or not? If divisibility is possible,… Read More »

Given an integer N, the task is to find whether fact(N) is divisible by sum(N) where fact(N) is the factorial of N and sum(N) =… Read More »

Given the NxN grid of horizontal and vertical roads. The task is to find out the number of ways that the person can go from… Read More »

Given an integer Y, find the smallest number X such that X! contains at least Y trailing zeros. Prerequisites – Count trailing zeroes in factorial… Read More »

Given two numbers n and r, the task is to find the value of nPr. nPr represents n permutation r which is calculated as n!/(n-k)!.… Read More »

Given two integer N and M, the task is to find the number of distinct numbers having N 0’s and M 1’s with no leading… Read More »