CountChars counts the number of a times a character has occurred in the provided string argument and returns a map with `rune` as keys and the count a

DefaultNew returns a new HashMap instance with default values

DelAtEnd deletes the snode at the tail(end) of the list and returns its value. Returns false if the list is empty.

Delete the current item.

DiceThrow returns the number of ways to get sum `sum` using `m` dice with `n` faces

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

Distance Function that gives Levenshtein Distance

Distance calculates the shortest distance between two points.

Distance calculates the distance between to vectors with the Pythagoras theorem

EditDistanceDP is an optimised implementation which builds on the ideas of the recursive implementation. We use dynamic programming to compute the DP

EggDropping finds the minimum number of attempts needed to find the critical floor with `eggs` number of eggs and `floors` number of floors

FastInverseSqrt assumes that argument is always positive, and it does not deal with negative numbers. The "magic" number 0x5f3759df is hex for 1597463

this function can do HasCycle() job but it is slower

FindKthMax returns the kth large element given an integer slice with nil `error` if found and returns -1 with `error` `search.ErrNotFound` if not foun

FindKthMin returns kth small element given an integer slice with nil `error` if found and returns -1 with `error` `search.ErrNotFound` if not found. N

Returns a mapping of vertices as path, if there is any from source to sink Otherwise, returns nil

FloydWarshall Returns all pair's shortest path using Floyd Warshall algorithm

GeneticString generates PopulationItem based on the imputed target string, and a set of possible runes to build a string with. In order to optimise st

Get a Node from the Binary-Search Tree

Has Determines the tree has the node of Key

Hash computes the SHA-1 hash of the input message

Hash computes the MD5 hash of the input message

Heap's Algorithm for generating all permutations of n objects

HuffDecode recursively decodes the binary code in, by traversing the Huffman compression tree pointed by root. current stores the current node of the

HuffEncode encodes the string in by applying the mapping defined by codes.

HuffEncoding recursively traverses the Huffman tree pointed by node to obtain the map codes, that associates a rune with a slice of booleans. Each cod

HuffTree returns the root Node of the Huffman tree by compressing listfreq. The compression produces the most optimal code lengths, provided listfreq

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

IsAlmostEqualTo verifies if two WeightedGraphs can be considered almost equal

IsInterleave checks if string `s1` and `s2` can be interleaved to form string `s3`

IsMatch checks if the string `s` matches the wildcard pattern `p`

IsParallel checks if two lines are parallel or not.

IsPerpendicular checks if two lines are perpendicular or not.

Returns true if s is subsequence of t, otherwise return false.

Iterative Faster iterative version of GcdRecursive without holding up too much of the stack

https://en.wikipedia.org/wiki/Josephus_problem This is a struct-based solution for Josephus problem.

Kahn's algorithm computes a topological ordering of a directed acyclic graph (DAG). `n` is the number of vertices, `dependencies` is a list of directe

Kmp Function kmp performing the Knuth-Morris-Pratt algorithm.

Kosaraju returns a list of Strongly Connected Components (SCCs).

LongestArithmeticSubsequence returns the length of the longest arithmetic subsequence

LongestPalindromicSubstring returns the longest palindromic substring in the input string

MaxCoins returns the maximum coins we can collect by bursting the balloons

MaxPathValueSearch is a method that searches the maximum path value in a tree given a certain depth

MaxSubArraySum returns the sum of the maximum subarray in the input array

MaxSubarraySum returns the maximum subarray sum

Merge Perform merge sort on a slice

MillerRabinDeterministic is a Deterministic version of the Miller-Rabin test, which returns correct results for all valid int64 numbers.

MillerRabinProbabilistic is a probabilistic test for primality of an integer based of the algorithm devised by Miller and Rabin.

MillerRandomTest This is the intermediate step that repeats within the miller rabin primality test for better probabilitic chances of receiving the co

Multiply64BitInt Checking if the integer multiplication overflows

Implementation of naive string search O(n*m) where n=len(txt) and m=len(pattern)

New creates a new HashMap instance with the specified size and capacity

NewCapacity function increase the Capacity

NewFenwickTree creates a new Fenwick tree, initializes bit with the values of the array. Note that the queries and updates should have one based index

NewLFU init the LFU cache with capacity

NewSegmentTree returns a new instance of a SegmentTree. It takes an input array of integers representing Array, initializes and builds the SegmentTree

Create a new SqrtDecomposition instance with the parameters as specified by SqrtDecomposition comment Assumptions: - len(elements) > 0

NthCatalan returns the n-th Catalan Number Complexity: O(n²)

OptimalBST returns the minimum cost of constructing a Binary Search Tree

Parenthesis algorithm checks if every opened parenthesis is closed correctly. When parcounter is less than 0 when a closing parenthesis is detected wi

PartitionProblem checks whether the given set can be partitioned into two subsets such that the sum of the elements in both subsets is the same.

Peak is return last value that insert into our stack

PointDistance calculates the distance of a given Point from a given line. The slice should contain the coefficiet of x, the coefficient of y and the c

Pop removes the minimum element (according to Less) from the heap. The complexity is O(log n) where n = h.Len().