Web Technologies37.4K+ articles

DSA22.8K+ articles

Misc8.8K+ articles

Mathematical7.8K+ articles

Arrays6.5K+ articles

Dynamic Programming1.6K+ articles

Combinatorial707+ articles

series515+ articles

Permutation and Combination146+ articles

factorial141+ articles

Given N blocks, out of which K is colored. These K-colored blocks are denoted by an array arr[]. The task is to count the number of ways to color the remaining uncolored b...read more

Algorithms

Analysis of Algorithms

Dynamic Programming

Mathematical

Combinatorial

Competitive Programming

Recursion

DSA

Arrays

Algorithms-Recursion

Permutation and Combination

binomial coefficient

Given an integer N, the task is to find theN^{th}Central binomial coefficient.The first few Central binomial coefficients for N = 0, 1, 2, 3... are1, 2, 6, 20, 70, 252, 92...read more

Mathematical

DSA

series

binomial coefficient

Given three integers N, M and K, the task is to calculate the sum of products of Binomial Coefficients C(N, i) and C(M, K - i), where i ranges between [0, K].\begin{*align...read more

Mathematical

Combinatorial

Competitive Programming

DSA

Permutation and Combination

binomial coefficient

Given an integer N, the task is to find the number of distinct bracket sequences that can be formed using 2 * N brackets such that the sequence is not N-periodic.A bracket...read more

Strings

Searching

Mathematical

Combinatorial

DSA

catalan

Permutation and Combination

binomial coefficient

Given an array, arr[] of size N consisting of elements from the range [1, N], that represents the order, in which the elements are inserted into a Binary Search Tree, the ...read more

Tree

Mathematical

Combinatorial

Binary Search Tree

Recursion

DSA

Arrays

factorial

Permutation and Combination

binomial coefficient

Given two integers M and X, the task is to find the number of sequences of length M that can be generated comprising X and -X such that their respective counts are equal a...read more

Misc

Greedy

Pattern Searching

Mathematical

Combinatorial

DSA

catalan

Permutation and Combination

binomial coefficient

Given an integer N, the task is to count the number of even and odd binomial coefficients up to Nth power.Examples:Input: N = 4Output:Odd: 2Even: 3Explanation:The binomial...read more

Misc

Bit Magic

Mathematical

DSA

setBitCount

number-digits

binomial coefficient

Given an array arr[] consisting of N integers, the task is to find the remaining array element after subtracting each element from its next adjacent element and removing t...read more

Mathematical

Combinatorial

DSA

Arrays

array-rearrange

binomial coefficient

Given a number N, the task is to count the combinations of K numbers from 1 to N having a sum equal to N, with duplicates allowed.Example:Input: N = 7, K = 3Output:15Expla...read more

Mathematical

Combinatorial

Python

DSA

binomial coefficient

Memoization

Given three values, N, L and R, the task is to calculate the sum of binomial coefficients (nCr) for all values of r from L to R.Examples:Input: N = 5, L = 0, R = 3Output: ...read more

Mathematical

Algo Geek

Algo-Geek 2021

DSA

array-range-queries

binomial coefficient

Given two integers N (1 = N = 1e9) and M (M = 1e5), the task is to find the number of ways to represent the number N in terms of the product of M integers. Find the answer...read more

Mathematical

DSA

combinatorics

sieve

prime-factor

Prime Number

Permutation and Combination

binomial coefficient

The Stars and Bars (also known as Balls and Urns) technique is a popular method used in Combinatorics, the study of counting and arrangement. It's a graphical way to solve...read more

Combinatorial

Competitive Programming

Picked

Geeks Premier League

DSA

combinatorics

python-dict

binomial coefficient

SQL-PL/SQL

Java-HijrahDate

Python numpy-Random

Geeks Premier League 2023

Given an array balls[] representing the count of colored balls labeled from 1 to k, the task is to determine the number of ways to draw the last ball of color i before dra...read more

Combinatorial

Competitive Programming

Picked

Geeks Premier League

DSA

combinatorics

Algorithms-Dynamic Programming

binomial coefficient

Geeks Premier League 2023

Given a positive integer k and an array arr[] of size n contains distinct elements, the task is to find the number of ordered pairs (A, B) that can be made where A and B a...read more

Combinatorial

Competitive Programming

Geeks Premier League

DSA

binomial coefficient

Geeks Premier League 2023

When we solve Dynamic Programming problems, we try to find a pattern by matching pattern with a standard DP problem. This is generally recommended to solve new DP problems...read more

Dynamic Programming

DSA

Fibonacci

LIS

LCS

catalan

binomial coefficient

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy PolicyGot It !