PronicNumber returns true if argument passed to the function is pronic and false otherwise.

RGBToHEX does exactly the opposite of HEXToRGB: it combines the three components red, green and blue to an RGB value, which can be converted to e.g. H

RLEdecode takes a run-length encoded string and returns the original string

RLEdecodebytes takes a run-length encoded byte slice and returns the original byte slice

RLEncode takes a string and returns its run-length encoding

RLEncodebytes takes a byte slice and returns its run-length encoding as a byte slice

Rear gets the last item from queue.

Recursive finds and returns the greatest common divisor of a given integer.

RecursivePower is recursive O(logn) function for pow(x, y)

RecursivePower1 is recursive O(n) function for pow(x, y)

Reverse Reverse the order of the linkedlist

ReverseBits This function initialized the result by 0 (all bits 0) and process the given number starting from its least significant bit. If the curren

SequenceGrayCode The function generates an "Gray code" sequence of length n

Sieve Sieving the numbers that are not prime from the channel - basically removing them from the channels

This function returns twin prime for given number returns (n + 2) if both n and (n + 2) are prime -1 otherwise

UpperBound returns index to the first element in the range [lowIndex, len(array)-1] that is greater than target. return -1 and ErrNotFound if no such

Verify is signature verification for DSA 1. Compute w = s^-1 mod q 2. Compute u1 = (H(m) * w) mod q 3. Compute u2 = (r * w) mod q 4. Compute v = ((g^u

XorSearchMissingNumber This function finds a missing number in a sequence

almostEqual subtracts two float64 variables and returns true if they differ less then float64EqualityThreshold reference: https://stackoverflow.com/a/

backQueue it will return the back data

encryptDecryptInt encrypts or decrypts the data using RSA algorithm

flip reverses the input slice from `0` to `i`.

frontQueue it will return the front data

getNodeByKey finds the node associated with the given key

hash generates a hash value for the given key

hexToBinary() function that will take Hexadecimal number as string, and return its Binary equivalent as a string.

hexToDecimal converts a hexadecimal string to a decimal integer.

increaseFreq increase the frequency if element

insertMap insert item in map

isTrivial checks if num's primality is easy to determine. If it is, it returns true and num's primality. Otherwise it returns false and false.

kthNumber use the selection algorithm (based on the partition method - the same one as used in quicksort).

lazyInit lazily initializes a zero List value.

least removes the node with lowest weight from q1, q2. It returns the node with lowest weight and the slices q1, q2 after the update.

Utility function to sort the slices and their contents

splitInt takes an integer x and splits it within an integer slice of length n in the most uniform way possible. For example, splitInt(10, 3) will retu

table building for kmp algorithm.

Returns true if it is possible to make a equals b (if b is an abbreviation of a), returns false otherwise

Add Adds value to the element at position pos of the array and recomputes the range sums.

ArticulationPoint identifies articulation points in a graph. It returns a boolean slice where each element indicates whether a vertex is an articulati

Back it will return the back value

func main() { myArrayOfK := [4]int{5, 6, 7, 8} var x int fmt.Println("\nBinomial Coefficient Using Dynamic Programming:", bin2(50, 5)) for _, elem

basically tries to color the graph in two colors if each edge connects 2 differently colored nodes the graph can be considered bipartite

BitCounter - The function returns the number of set bits for an unsigned integer number

BoolArrayCapUp Dynamically increases an array size of bool's by 1.

Implementation of boyer moore string search O(l) where l=len(text)

BreadthFirstSearch is an algorithm for traversing and searching graph data structures. It starts at an arbitrary node of a graph, and explores all of

Bubble is a simple generic definition of Bubble sort algorithm.

Build builds the SegmentTree by computing the sum of different ranges. node, leftNode and rightNode should always start with 1, 0 and len(Array)-1, re

Functions that builds Aho Corasick automaton.

BuildExtendedAc Functions that builds extended Aho Corasick automaton.

CoinChange finds the number of possible combinations of coins of different values which can get to the target amount.

ColorUsingBFS will return the Color of each vertex and the total number of different colors used, using BFS

ColorUsingBacktracking will return the Color of each vertex and the total number of different colors used, using backtracking

ColorUsingGreedyApproach will return the Color of each vertex and the total number of different colors used, using a greedy approach, based on the num

Combine ...

ComputeAlphabet Function that returns string of all the possible characters in given patterns.

Contains Returns 'true' if array of int's 's' contains int 'e', 'false' otherwise.

Cos returns the cosine of the radian argument x. [See more](https://en.wikipedia.org/wiki/Sine_and_cosine) [Based on the idea of Bhaskara approximati

Count returns the current size of the list.