Returns index of the maximum element in arr[0..n-1]

Function to find the minimum number of coins required to get a total of `target` from set `S`

Function to find the matrix, A[][] satisfying the given conditions

Find the peak element in the array

Function to find the minimum number of platforms required at the railway station such that no train waits.

Function to find repeated element and its frequency.

Function to print all subarrays in the array which has sum 0

returns the number of solutions where x is in the range[minx, maxx] and y is in the range[miny, maxy]

a*x+b*y=c. returns valid x and y if possible. all solutions are of the form (x0 + k * b / g, y0 - k * b / g)

Function to find first Missing Positive Integer

Function to count the frequency of all elements from 1 to N in the array.

Function to count the frequency of all elements from 1 to N in the array.

Function to check if the queue is full */

Returns GCD(a,b) by Euclid's algorithm.

Generate primes up to N

This function generates the key in a cyclic manner until it's length isi'nt equal to the length of original text

A utility function to get maximum value in arr[]

This function returns median of ar1[] and ar2[]. Assumptions in this function: Both ar1[] and ar2[] are sorted arrays Both have n elements */

>>> greatest_common_divisor(7,5) 1 Note : In number theory, two integers a and b are said to be relatively prime, mutually prime