# Category Archives: Mathematical

## Confidence Interval

Prerequisites: t-test , z-test In simple terms, Confidence Interval is a range where we are certain that true value exists. The selection of a confidence… Read More »

## Count clockwise array rotations required to maximize count of array elements present at indices same as their value

Given an array arr[] consisitng of a permutation of first N natural numbers, the task is to find the minimum number of clockwise circular rotations… Read More »

## Check if GCD of all Composite Numbers in an array divisible by K is a Fibonacci Number or not

Given array arr[] consisting of N non-negative integers, and an integer K, the task is to check if GCD of all composite numbers in the… Read More »

## Construct smallest N-digit number possible by placing digits at positions specified by given array

Given two integers N and M and an 2D array arr[], the task is to construct the smallest possible integer of N digits ( without… Read More »

## Maximize minimum of array generated by maximums of same indexed elements of two rows of a given Matrix

Given a matrix mat[][] of N rows and M columns, the task is to choose any two rows(i, j) (0 ≤ i, j ≤ N… Read More »

## Count subsequences for every array element in which they are the maximum

Given an array arr[] consisting of N unique elements, the task is to generate an array B[] of length N such that B[i] is the… Read More »

## Predict the winner of a card game of removing K cards in each turn such that Bitwise AND of K and size of pile is 0

There are two players A and B and a pile of N cards stacked upon each other.  The task is to find the winner of… Read More »

## Kruskal Wallis Test

Kruskal Wallis Test: It is a nonparametric test. It is sometimes referred to as One-Way ANOVA on ranks. It is a nonparametric alternative to One-Way… Read More »

## Maximize sum of MEX values of each node in an N-ary Tree

Given an N-ary tree rooted at 1, the task is to assign values from the range [0, N – 1] to each node in any… Read More »

## Smallest pair of indices with product of subarray co-prime with product of the subarray on the left or right

Given an array arr[] of length N, the task is to find the smallest pair of indices (i, j) such that the product of elements… Read More »

## Maximize count of rows consisting of equal elements by flipping columns of a Matrix

Given a binary matrix, mat[][] of dimensions N * M, the task is to maximize the count of rows consisting only of equal elements by… Read More »

## Partial derivative of a polynomial using Doubly Linked List

Given a 2-variable polynomial represented by a doubly linked list, the task is to find the partial derivative of a polynomial stored in the doubly-linked… Read More »

## Polynomial Division using Linked List

Given two polynomials P1 and P2 in the form of a singly linked list respectively, the task is to print the quotient and remainder expressions… Read More »

## Partition array into minimum number of equal length subsets consisting of a single distinct value

Given an array arr[] of size N, the task is to print the minimum count of equal length subsets the array can be partitioned into… Read More »

## Largest divisor of a number not divisible by another given number

Given two positive integers P and Q, the task is to largest divisor of P which is not divisible by Q. Examples: Input: P =… Read More »