## Find sum of even index binomial coefficients

Given a positive integer n. The task is to find the sum of even indexed binomial coefficient. That is, nC0 + nC2 + nC4 +… Read More »

- Sum of GCD of all possible sequences
- Longest permutation subsequence in a given array
- Number of ways to write N as a sum of K non-negative integers
- Probability of getting K heads in N coin tosses
- Total number of BSTs using array elements
- Sum of all subsequences of length K
- Count ways to reach the Nth stair using multiple 1 or 2 steps and a single step 3
- Count rotations which are divisible by 10
- Number of pairs such that path between pairs has the two vertices A and B
- Number of subsets with same AND, OR and XOR values in an Array
- Count numbers in a range with digit sum divisible by K having first and last digit different
- Count number of triangles possible for the given sides range
- Count numbers less than N containing digits from the given set : Digit DP
- Number of ways to place two queens on a N*N chess-board
- Count of Binary strings of length N having atmost M consecutive 1s or 0s alternatively exactly K times
- Find the Number of Permutations that satisfy the given condition in an array
- Count numbers with exactly K non-zero digits and distinct odd digit sum
- Count of distinct XORs formed by rearranging two Binary strings
- Total number of Subsets of size at most K
- Count the numbers with N digits and whose suffix is divisible by K
- Count the number of ways to fill K boxes with N distinct items
- Number of ways to color N-K blocks using given operation
- Print the two possible permutations from a given sequence
- Count of common subarrays in two different permutations of 1 to N
- Find sum of xor of all unordered triplets of the array
- Count of K-size substrings having palindromic permutations
- Product of all sorted subsets of size K using elements whose index divide K completely
- Find the K-th Permutation Sequence of first N natural numbers
- Maximum number of strings that can be formed with given zeros and ones
- Sort decreasing permutation of N using triple swaps

Given a positive integer n. The task is to find the sum of even indexed binomial coefficient. That is, nC0 + nC2 + nC4 +… Read More »

Given an arr of size n. The problem is to count all the subsequences having maximum number of distinct elements. Examples: Input : arr[] =… Read More »

The trinomial triangle is a variation of Pascal’s triangle. The difference between the two is that an entry in the trinomial triangle is the sum… Read More »

The Leibniz harmonic triangle is a triangular arrangement of unit fractions in which the outermost diagonals consist of the reciprocals of the row numbers and… Read More »

Given n, how many distinct Max Heap can be made from n distinct integers? Examples: Input : n = 3 Output : Assume the integers… Read More »

We are given a sequence of numbers from 1 to n. Each permutation in the sequence that we need to generate should differ from the… Read More »

Given a positive integer n. The task is to find the maximum coefficient term in all binomial coefficient. The binomial coefficient series is nC0, nC1,… Read More »

In mathematics, the telephone numbers involution numbers are a sequence of integers are a sequence of integers that count the number of connection patterns in… Read More »

Given an integer max, print Binomial Coefficients table that prints all binomial coefficients B(m, x) where m and x vary from 0 to max Example… Read More »

Given two natural number n and m. The task is to find the number of ways in which the numbers that are greater than or… Read More »

The Entringer Number E(n, k) are the number of permutations of {1, 2, …, n + 1}, starting with k + 1, which, after initially… Read More »

Given a positive integer n, the task is to find the sum of binomial coefficient i.e nC0 + nC1 + nC2 + ……. + nCn-1… Read More »

In combinatorics, the Eulerian Number A(n, m), is the number of permutations of the numbers 1 to n in which exactly m elements are greater… Read More »

In combinatorial mathematics, the Lobb number Lm, n counts the number of ways that n + m open parentheses can be arranged to form the… Read More »

Given three positive integers n, k and x. The task is to count the number of different array that can be formed of size n… Read More »