ArrayUnion Concats two arrays of int's into one.

BackQueue return the Back value

Binary search for target within a sorted array by repeatedly dividing the array in half and comparing the midpoint with the target. This function uses

BinaryIterative search for target within a sorted array by repeatedly dividing the array in half and comparing the midpoint with the target. Unlike Bi

BinaryToDecimal() function that will take Binary number as string, and return its Decimal equivalent as an integer.

Bitwise This function returns the minimum integer using bit operations

CatalanNumber This function returns the `nth` Catalan number

C is Binomial Coefficient function This function returns C(n, k) for given n and k

Add all of other's keys starting from idx and children starting from idx + 1

ConstructTrie Function that constructs Trie as an automaton for a set of reversed & trimmed strings.

CreateNewState Automaton function for creating a new state 'state'.

DecimalToBinary() function that will take Decimal number as int, and return its Binary equivalent as a string.

Decrypt decrypts encrypted rune slice based on the RSA algorithm

DecryptString decrypts the data using RSA algorithm returns the decrypted string

DefaultPolynomial is the commonly used polynomial g(x) = (x^2 + 1) mod n

DelAtBeg deletes the snode at the head(beginning) of the list and returns its value. Returns false if the list is empty.

DequeueFront deletes an item from front of Deque and returns it.

DequeueRear deletes an item from rear of Deque and returns it.

Destroy all items in the list.

Encrypt encrypts based on the RSA algorithm - uses modular exponentitation in math directory

EnqueueFront adds an item at the front of Deque.

EnqueueRear adds an item at the rear of Deque.

EuclideanDistance returns the Euclidean distance between points in any `n` dimensional Euclidean space.

Extended simple extended gcd

Formula This function calculates the n-th fibonacci number using the [formula](https://en.wikipedia.org/wiki/Fibonacci_number#Relation_to_the_golden_r

Front it will return the front value

Front gets the front item from queue.

FrontQueue return the Front value

Generate returns a int slice of prime numbers up to the limit

Generate generates the sequence of integers starting at 2 and sends it to the channel `ch`

GenerateMutualKey : generates a mutual key that can be used by only alice and bob mutualKey = (shareKey^prvKey)%primeNumber

GenerateShareKey : generates a key using client private key , generator and primeNumber this key can be made public shareKey = (g^key)%primeNumber

GenerateTriangle This function generates a Pascal's triangle of n lines

Get function is return one element with the index of array

GetParent Function that finds the first previous state of a state and returns it. Used for trie where there is only one parent.

GetPublicKey returns the public key (y)

GetWord Function that returns word found in text 't' at position range 'begin' to 'end'.

HEXToRGB splits an RGB input (e.g. a color in hex format; 0x<color-code>) into the individual components: red, green and blue

Hash hashes the input message using the sha256 hashing function, and return a 32 byte array. The implementation follows the RGC6234 standard, which is

Init initializes double linked list

Interpolation searches for the entity in the given sortedData. if the entity is present, it will return the index of the entity, if not -1 will be ret

IsEmpty returns true if the stack is empty, false otherwise.

IsEmpty checks whether Deque is empty or not.

IsKrishnamurthyNumber returns if the provided number n is a Krishnamurthy number or not.

Checks if inNumber is a perfect number

IsPowOfTwoUseLog This function checks if a number is a power of two using the logarithm. The limiting degree can be from 0 to 63. See alternatives in

IsPowerOfTwo This function uses the fact that powers of 2 are represented like 10...0 in binary, and numbers one less than the power of 2 are represen

IsPowerOfTwoLeftShift This function takes advantage of the fact that left shifting a number by 1 is equivalent to multiplying by 2. For example, binar

IsProperSubsetOf: checks whether set is proper subset of set2 or not. ex: [1,2,3] proper subset of [1,2,3,4] -> true

IsProperSupersetOf: checks whether set is proper superset of set2 or not. ex: [1,2,3,4] proper superset of [1,2,3] -> true

Iterative returns the iteratively brute forced factorial of n

IterativePower is iterative O(logn) function for pow(x, y)

Jump search works by jumping multiple steps ahead in sorted list until it find an item larger than target, then create a sublist of item from the last

Knapsack solves knapsack problem return maxProfit

Length gets the length of Deque.

Linear Simple linear search algorithm that iterates over all elements of an array in the worst case scenario

Lambda is the liouville function This function returns λ(n) for given number

LogBase2 Finding the exponent of n = 2**x using bitwise operations (logarithm in base 2 of n) [See more](https://en.wikipedia.org/wiki/Logarithm)

LongestCommonSubsequence function

LowerBound returns index to the first element in the range [0, len(array)-1] that is not less than (i.e. greater or equal to) target. return -1 and Er

For each node, we will precompute its ancestor above him, its ancestor two nodes above, its ancestor four nodes above, etc. Let's call `jump[j][u]` is

Luhn validates the provided data using the Luhn algorithm.

Matrix This function calculates the n-th fibonacci number using the matrix method. [See](https://en.wikipedia.org/wiki/Fibonacci_number#Matrix_form)

MeanUsingAndXor This function finds arithmetic mean using "AND" and "XOR" operations

MeanUsingRightShift This function finds arithmetic mean using right shift

MonteCarloPiConcurrent approximates the value of pi using the Monte Carlo method. Unlike the MonteCarloPi function (first version), this implementatio

Initialise a new union find data structure with s nodes

Phi is the Euler totient function. This function computes the number of numbers less then n that are coprime with n.

PollardsRhoFactorization is an implementation of Pollard's rho factorization algorithm using the default parameters x = y = 2

** * Problem 19 - Counting Sundays * @see {@link https://projecteuler.net/problem=19} * * You are given the following information, * but you may prefe