## Permutation Coefficient

Problem Statement   In this problem “Permutation Coefficient”, we need to find it when we are given the values of n & k. Example   n = 5, k = 2 20 Explanation: This value of n P r is found using the formula of the permutation coefficient.  nPr = n!/(n-r)! Approach …

## Construction of Longest Increasing Subsequence (N log N)

Problem Statement   You are given an array of integers. The problem “Construction of Longest Increasing Subsequence (N log N)” asks to construct the longest increasing subsequence. Example   arr[]={1, 4, 7, 2, 9, 6, 12, 3 } 12, 9, 7, 4, 1 and the size of this longest increasing subsequence is …

## Three way partitioning of an array around a given range

Problem Statement   You are given an array of integers and a range of lowValue and highValue. The problem “Three way partitioning of an array around a given range” asks to partition the array such that array will be divided into three parts. The partitions of the arrays will be: Elements …

## Count the number of nodes at given level in a tree using BFS

Description   The problem “Count the number of nodes at given level in a tree using BFS” states that you are given a Tree (acyclic graph) and a root node, find out number of nodes at L-th level. Acyclic Graph: It is a network of nodes connected through edges which has …

## Count pairs from two sorted arrays whose sum is equal to a given value x

Problem Statement   “Count pairs from two sorted arrays whose sum is equal to a given value x” problem states that you are given two sorted arrays of integers and an integer value called sum. The problem statement asks to find out the total number of pair which sums up to … 