Put function is change/update the value in array with the index and new value

Query returns the sum of elements of the array in the interval [firstIndex, leftIndex]. node, leftNode and rightNode should always start with 1, 0 and

Performs a query from index start to index end (non included) Assumptions: - start < end - start and end are valid

QuicksortRange Sorts the specified range within the array

RangeSum returns the sum of the elements in the range l to r both inclusive.

Recursive calculates the n-th fibonacci number recursively by adding the previous two Fibonacci numbers. This algorithm is extremely slow for bigger n

Remove function is remove an element with the index

Reverse() function that will take string, and returns the reverse of that string.

ReversePartition Reverse the linked list from the ath to the bth node

Section calculates the Point that divides a line in specific ratio. DO NOT specify the ratio in the form m:n, specify it as r, where r = m / n.

show all value as an interface array

SymbolCountOrd computes sorted symbol-frequency list of input message

SymmetricDifference: gives new symmetric difference set of both sets. ex: [1,2,3] SymmetricDifference [3,4,5] -> [1,2,4,5]

TernaryMax is a function to search for maximum value of a uni-modal function `f` in the interval [a, b]. a and b should be finit numbers

TernaryMin is a function to search for minimum value of a uni-modal function `f` in the interval [a, b]. a and b should be finit numbers.

TilingProblem returns the number of ways to tile a 2xN grid using 2x1 dominoes

Top returns the minimum element (according to Less) from the heap. Top panics if the heap is empty.

Topological assumes that graph given is valid and that its possible to get a topological ordering. constraints are array of []int{a, b}, representing

TrapRainWater calculates the amount of trapped rainwater between the bars represented by the given elevation map. It uses dynamic programming to preco

Bipartite.go description: Implementation of the Bipartite graph coloring algorithm details: A bipartite graph is a graph whose vertices can be divided

Union: gives new union set of both sets. ex: [1,2,3] union [3,4,5] -> [1,2,3,4,5]

UniquePaths implements the solution to the "Unique Paths" problem

Update updates the elements of the array in the range [firstIndex, lastIndex] with the new value provided and recomputes the sum of different ranges.

Assumptions: - index is valid

Show list body.

WordBreak checks if the input string can be segmented into words from a dictionary

YIntercept calculates the Y-Intercept of a line from a specific Point.

This function get the result of adding the bytes in data to the crc

articulationPointHelper recursively traverses the graph using DFS and marks articulation points. It updates `childCount`, `discoveryTime`, and `earlie

bigFactorial returns the factorial of n as a big.Int Use big package to handle large numbers

calculateRunSize returns a run size parameter that is further used to slice the data slice.

colorVertex will try to color provided vertex, v

doSort is the recursive function that implements the circle sort algorithm.

drawPoints draws n random two-dimensional points in the interval [0, 1), [0, 1) and sends through c the number of points which where within the circle

Parameter generation for DSA 1. FIPS 186-4 specifies that the L and N values must be (1024, 160), (2048, 224), or (3072, 256) 2. Choose a N-bit prime

eliminate clear the least frequently operated element

Helper function to fill the stack with vertices in the order of their finish times.

formatNum accepts a number and returns the odd number d such that num = 2^s * d + 1

getDiceThrowTestCases provides the test cases for DiceThrow

getIsPerfectNumberTestCases returns an array of test data for the tests of the function IsPerfectNumber Data was verified using [A000396]. [A000396]:

getPartitionProblemTestCases returns a list of test cases for the Partition Problem

getSumOfProperDivisorsTestCases returns an array of test data for the tests of the function SumOfProperDivisors. Data was verified using [A001065]. [A

This function get 256-byte (256x8) table for efficient processing.

getWildcardMatchingTestCases returns a list of test cases for the Wildcard Matching problem

initItem to init item for LFU

insert a single word at a Trie node.

insertionSortRuns runs insertion sort on all the data runs one by one.

Checks if the array p matches the subarray of t starting at pos. Note that backward iteration. There are [other](https://en.wikipedia.org/wiki/Boyer%E

keyGen is key generation for DSA 1. Choose a random integer x from the range [1, q-1] 2. Compute y = g^x mod p

leftRotate rotates x left by n bits

Function to find the leftmost index in arr with value >= val, mimicking the inbuild lower_bound function in C++ Time Complexity: O(logn) Auxiliary Spa