# Category Archives: Combinatorial

Given positive integers N, X and Y. The task is to find the count of unique binary strings of length N having X 0s and… Read More
Given three numbers N, X, and Y, find the count of unique binary strings of length N having at least X 0s and Y 1s.… Read More
Given two integers N and K, the task is to find the count of sequences of K elements from the range [1, N] where every… Read More
Given integers N, P, Q, X, and Y, the task is to find the number of ways to form a group of N people having… Read More
Given a number N, the task is to find the total number of balanced binary strings possible of length N. A binary string is said… Read More
Given integers N, P, Q, X, and Y, the task is to find the number of ways to form a group of N people having… Read More
Given integers N, P, and Q the task is to find the number of ways to form a group of N people having at least… Read More
Given a positive number N, the task is to find the number of ways to reach N from 2 wherein each operation one of the… Read More
Given vector nums, the task is to print all the possible permutations of the given vector using backtracking  Examples: Input: nums[] = {1, 2, 3}Output:… Read More
Given an array arr[] consisting of values (0, 1, 2, 3) of length N, representing the type of work that can be done on any… Read More
Given R red balls, G green balls, B blue balls. A set can have 1, 2, or 3 balls. Also, a set could have all… Read More
Given an integer N and a vector of strings prefixes[], the task is to calculate the total possible strings of length N from characters ‘0’… Read More
Given an array, arr[] and weight W. The task is to minimize the number of Knapsacks required to store all elements of the array. A… Read More
Given a number N, representing count of elements and is equal to 2K, the task is to find the number of ways these elements can… Read More
Given an integer N., The task is to find the number of distinct permutations of length N, such that the bitwise AND value of each… Read More