Peek returns the item at the front of the queue without removing it. Returns an error if the queue is empty.

Slope calculates the slope (gradient) of a line.

Transform: A B | a b c d Into: A c B / \ a b d

StateExists Checks if state 'state' exists. Returns 'true' if it does, 'false' otherwise.

isEmpty it will check our list is empty or not

AddVertex will add a new vertex in the graph, if the vertex already exist it will do nothing

Base64Decode decodes the received input base64 string into a byte slice. The implementation follows the RFC4648 standard, which is documented at https

Base64Encode encodes the received input bytes slice into a base64 string. The implementation follows the RFC4648 standard, which is documented at http

Compact will remove unecessay nodes, reducing the capacity, returning true if node n itself should be removed.

GetData function return all value of array

IntArrayCapUp Dynamically increases an array size of int's by 1.

IntToRoman converts an integer value to a roman numeral string. An error is returned if the integer is not between 1 and 3999.

IsEmptyQueue check our list is empty or not

IsSubsetOf: checks whether set is subset of set2 or not.

LenQueue will return the length of the queue list

New creates a new DSA instance

Constructor functions for graphs (undirected by default)

Create new node.

OptimizedTrialDivision checks primality of an integer using an optimized trial division method. The optimizations include not checking divisibility by

peak return last input value

Pop is return last value that insert into our stack also it will remove it in our stack

Push add a value into our stack

RomanToInt converts a roman numeral string to an integer. Roman numerals for numbers outside the range 1 to 3,999 will return an error. Nil or empty s

Size returns the size of the heap

Size returns the number of words in the Trie

balanceFactor : negative balance factor means subtree Root is heavy toward Left and positive balance factor means subtree Root is heavy toward Right s

len is return the length of queue

Abs returns absolute value using binary operation Principle of operation: 1) Get the mask by right shift by the base 2) Base is the size of an integer

AddAtEnd Add a node at the end of the linkedlist

CRC8 calculates CRC8 checksum of the given data.

CheckRangeFromIndex function it will check the range from the index

CreateTransition Creates a transition for function σ(state,letter) = end.

Decrypt decrypts by left shift of "key" each character of "input"

Decrypt decrypts with Xor encryption

Decrypt decrypts with polybius encryption

DelAtBeg Delete the node at the beginning of the linkedlist

DetAtEnd Delete a node at the end of the linkedlist

Delete: deletes the passed element from the set if present

Encrypt encrypts with Xor encryption after converting each character to byte The returned value might not be readable because there is no guarantee wh

Encrypt encrypts with polybius encryption

EncryptString encrypts the data using RSA algorithm returns the encrypted string

Factorize is a function that computes the exponents of each prime in the prime factorization of n

GetParameters returns the DSA parameters (p, q, g)

GetPrivateKey returns the private Key (x)

Inverse Modular function

IsFull checks if the queue is full.

IsSupersetOf: checks whether set is superset of set2 or not.

Lcm returns the lcm of two numbers using the fact that lcm(a,b) * gcd(a,b) = | a * b |

Transform: A B C / \ a b Into: A C | a B c

MillerTest tests whether num is a strong probable prime to a witness. Formally: a^d ≡ 1 (mod n) or a^(2^r * d) ≡ -1 (mod n), 0 <= r <= s

New initializes the RSA algorithm returns the RSA object

https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/ NthFibonacci returns the nth Fibonacci Number

PrefixSum returns the sum of the prefix ending at position pos.

Propagate propagates the lazy updates to the child nodes

Rotate list by P places. This method is interesting for optimization. For first optimization we must decrease P value so that it ranges from 0 to N-1.

Sign is signature generation for DSA 1. Choose a random integer k from the range [1, q-1] 2. Compute r = (g^k mod p) mod q 3. Compute s = (k^-1 * (H(m

Size returns the size of the queue.

Perform matrix multiplication using Strassen's algorithm

Returns the sum of proper divisors of inNumber.

leftRotate rotates x left by n bits

r = (b^e)%mod

rot13 is a special case, which is fixed the shift of 13, of the Caesar cipher

Abs returns absolute value

AddVertex will add a new vertex in the graph. If the vertex already exists it will do nothing.

AhoCorasick Function performing the Basic Aho-Corasick algorithm. Finds and prints occurrences of each pattern.

This function returns s(n) for given number