## Entringer Number

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

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

We are given an infinite two dimensional plane made of hexagons connected together. We can visualize this plane as a honeycomb. Element X is present… 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 mathematics, a Newman–Shanks–Williams prime (NSW prime) is a prime number p which can be written in the form: Recurrence relation for Newman–Shanks–Williams prime is:… 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 two strings A and B. The task is to count the number of ways to insert a character in string A to increase the… Read More »

Given an array of size n. The problem is to find the length of the subsequence in the given array such that all the elements… Read More »

In mathematics, a Delannoy number D describes the number of paths from the southwest corner (0, 0) of a rectangular grid to the northeast corner… Read More »

A subarray is called alternating if any two consecutive numbers in it have opposite signs (i.e. one of them should be negative, whereas the other… Read More »

We are given a number n, we need to find the maximum sum possible with the help of following function: F(n) = max( (F(n/2) +… Read More »

Given a binary string of 0s and 1s. The task is to find the length of substring which is having maximum difference of number of… Read More »

Given a text and a wildcard pattern, implement wildcard pattern matching algorithm that finds if wildcard pattern is matched with text. The matching should cover… 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 »

Given a string S of length n and a positive integer k. The task is to find number of Palindromic Subsequences of length k. Examples:… Read More »

Given a matrix of N X M, each cell consist of an integer. We have initial power of K and we are allowed to move… Read More »