@brief Check if node is a 3-node or 4-node, this is useful when we * delete item from 2-3-4 tree * @return true if node is 3-node or 4-node,

* @brief Function to check a word's presence in the trie (Basic) * @param key the string key to be searched in the trie * @return true if the key

* @brief Function that add an edge between two nodes or vertices of graph * * @param u is a node or vertex of graph * @param v is a node or vertex

* @brief Compare two floating point numbers with a certain tolerance. * This is needed as with some values, the result (e.g.: -196.15) might be a bit

* @brief Recursive function to check if a value is in the BST. * * @param node The node to search from. * @param value The value to fin

* @brief Doest bitset contains element x * * @param x position in bitset to check * @returns true if bit position x is 1 * @returns false if bit p

* @brief The main function implements count of bits flip required * @param A is the given number whose bits will be flipped to get number B * @param

* @brief Function to compute the n-th Fibonacci number * @param n the index of the Fibonacci number * @returns n-th element of the Fibonacci's seque

* @brief The main function that checks * the number of digits in a number. * TC : O(number of digits) * @param n the number to check its digits *

* @brief This function finds the number of digits * in constant time using logarithmic function * TC: O(1) * @param n the number to check its digit

* @brief The main function to generate n-bit Gray code * * @param n Number of bits * @return A vector that stores the n-bit Gray code */

* @brief Insert the new element in the list * @param val element that will be inserted * @returns void */

* @brief Inserts all the values from a vector into the Circular Linked List * @details Goes through each element in the vector sequentially, inse

* @brief Conversion from Kelvin to Celsius algorithm. * @param number the Celsius number that will be used to convert * @returns the Kelvin number c

* @brief Function to calculate Euler's Totient * @param n the number to find the Euler's Totient of */

* @brief pop the last node in the linked list. */

* @brief Postfix Evaluation algorithm to compute the value from given input * array * @param input vector of strings consisting of numbers and opera

* @brief predict/recommend a word that starts with a given prefix * @param prefix string to search for * @returns list of recommended words

* @brief Prints the values of a vector sequentially, ending with a newline * character. * @param array Reference to the array to be printed * @retu

* @brief Get left child of item at item_index * @param item_index index of the item whose left child to be get * @return left child of item

* @brief Get right child of item at item_index * @param item_index index of the item whose right child to be get * @return right child of i

* @brief Set item value at position of index * @param index the index of the item to set * @param new_item item value */

* @brief Counts the number of paths from node `u` to node `v` in a directed graph * using Depth First Search (DFS) * * @param A adjace

* @brief The cumulative distribution function * @details The sum of all probabilities up to (and including) k trials. * Basically CDF(k) = P

Display a list. and total element */

* Dot product function. * Takes 2 vectors along with their dimension as input and returns the dot * product. * @param x vector 1 * @param y vector

* Iteratively frees each node in the Circular Linked List from the heap */

* This function finds nth fibonacci number in a given modulus * @param n nth fibonacci number * @param mod modulo number */

* @brief Utility function for finding index * @details Utility function for finding the position of a character in array * `chars` * @param c chara

* @brief get the value from i units from right and j units from left side * of the board * @param i integer denoting ith row * @param j

* @brief Gets the intersection of two sorted arrays, and returns them in a * vector. * @details An algorithm is used that compares the elements of t

* @brief Level order traversal of a tree consists of visiting its * elements, top to bottom, left to right. This function performs * level o

* @brief Gets the union of two sorted arrays, and returns them in a * vector. * @details An algorithm is used that compares the elements of the two

Hash a key * @param key key value to hash * @returns hash of the key */

* @brief Hash a key. Uses the STL library's `std::hash()` function. * * @param key value to hash * @return hash value of the key */

* @brief Hash a key. Uses the STL library's `std::hash()` function. * * @param key value to hash * @return hash value of the key */

Inserts a new key 'k'

* @brief Function to check whether the number is armstrong number or not. * @param number to be checked * @return `true` if the number is armstrong.

* @brief Function to check if the given number is factorial of some number or * not. * @param n number to be checked. * @return true if number is a

* @brief Calculates the factorial iteratively. * @param n Nth factorial. * @return Factorial. * @note 0! = 1. * @warning Maximum=20 because there

* @brief KMP algorithm to find a pattern in a text * @param pattern string pattern to search * @param text text in which to search * @returns the s

* @brief Utility function to find the last element of the list * @returns the last element of the list */

* Function for finding the least common multiple of two numbers. * @params integer x and y whose lcm we want to find. * @return lcm of x and y using

* @brief Function to find the length of the longest substring without repeating characters. * @param s Input string. * @return Length of the

return sample mean computed till last sample */

* This function search the element in an array for the given index. * @param A array where numbers are saved * @param idx current index in array * @re

Constructor * \param[in] x new data sample */

* @brief Pops an element from the stack * * @return The popped element * @throws std::out_of_range if the stack is empty */

* @brief Prints the values of a vector sequentially, ending with a newline * character. * @param array Reference to the array to be printed * @retu

* @brief Prints the values of a vector sequentially, ending with a newline * character. * @param array Reference to the array to be printed * @retu

* @brief Prints the values of a vector sequentially, ending with a newline * character. * @param array Reference to the array to be printed * @retu

* @brief Prints all of the elements in the tree to stdout * level-by-level, using the get_level_order() function. * @returns void */

* @brief Pushes an element onto the stack * * @param element Element to push onto the stack */

* @brief upsert a key-value pair * @param key key of the key-value pair * @param value value of the key-value pair */

* @brief upsert a key-value pair * @param key key of the key-value pair * @param value value of the key-value pair */

* Create the distance matrix or * [U-matrix](https://en.wikipedia.org/wiki/U-matrix) from the trained * 3D weiths matrix and save to disk. * * \pa

* @brief Parent function of binarySearch and linearSearch methods * @param val element that will be searched * @return index of element in t

* @brief Get the number of values in the BST. * * @return std::size_t Number of values in the BST. */

* @brief Utility function to find the top element of the list * @returns the top element of the list */

* @brief Helper method for update method below * @param i The index of the current node * @param l The leftmost node of the current node

return data variance computed till last sample */

* @brief Method that combines two disjoint sets to which i and j belongs to * and make a single set having a common representative. * @param

* @brief Function to check whether the pair is amicable or not. * @param x First number. * @param y Second number. * @return `true` if the pair is

* Function to calculate sum of binomial coefficients * @param n number * @return Sum of binomial coefficients of number */

* @brief Checks whether the given element (default is `1`) can jump to the last * index. * @param nums array of numbers containing the maximum jump

* @brief Computes size of the padded input * @param input Input string * @return size_t Size of the padded input */

* @brief will allocate the memory for a node and, along the data and return the * node. * @param data value that a particular node will contain.

* //Recursive function/method to implement depth first traversal(dfs): * @param v vertices * @param vis array to keep track of visited nodes (boolea

* @brief Implementation of digitSeparationForwardOrder method. * * @param largeNumber The large number to separate digits from. * @retu

* @brief Implementation of digitSeparationReverseOrder method. * * @param largeNumber The large number to separate digits from. * @retu

Displays the table * @returns None */

Displays the table * @returns None */

Function to displays the table * @returns none */

* @brief the expected value of the exponential distribution * @returns \f[\mu = \frac{1}{\lambda}\f] */

* @brief the standard deviation of the exponential distribution * @returns \f[\sigma = \frac{1}{\lambda}\f] */

* @brief the variance of the exponential distribution * @returns \f[\sigma^2 = \frac{1}{\lambda^2}\f] */

* Function to compute sum of fibonacci sequence from n to m. * @param n start of sequence * @param m end of sequence * @returns uint64_t the sum of

* @brief Recursive function to find the maximum value in the BST. * * @param node The node to search from. * @param ret_value Variable

* @brief Recursive function to find the minimum value in the BST. * * @param node The node to search from. * @param ret_value Variable

* @brief Converts the string to bytestring and calls the main algorithm * @param message Plain character message to hash * @return void* Pointer to

* @brief Computes integral approximation * @param lb lower bound * @param ub upper bound * @param func function passed in * @param delta * @

* @brief Function to calculate largest power * @param n number * @param p prime number * @returns largest power */

* Function to compute sum of euler totients in sumOfEulerTotient vector * @param num input number * @returns int Sum of LCMs, i.e. ∑LCM(i, num) from

* @brief function to convert a C++ string to lower case * @param word takes an std::string as input * @returns std::string */

* Function to check if the given number is magic number or not. * @param n number to be checked. * @return if number is a magic number, returns true

* @brief This function calculates modular division * @param a integer dividend * @param b integer divisor * @param p integer modulo * @return a/b