Checks the element at the rear of the queue without removing it. @return Element at the rear of the queue. @throws IllegalStateException if the queue

Pushes a new element onto the {@code stack}. If the value is less than or equal to the current minimum, it is also pushed onto the {@code minStack}.

Unites the sets containing elements x and y. Uses union by rank to attach the smaller tree under the larger tree. @param x the first element @param y

Inserts an element at the back of the queue. @param element The element to be added to the queue. @return {@code true} if the element was successfull

Adds a new Edge to the graph. If the nodes aren't yet in nodeList, they will be added to it. @param startNode the starting Node from the edge @param

Creates a centroid tree from an edge list. @param n number of nodes (0-indexed: 0 to n-1) @param edges list of edges where each edge is [u, v] @retur

Builds a Huffman tree from the given character array and their frequencies. @param charArray array of characters @param charFreq array of frequencie

Returns the smallest double value that is greater than or equal to the input. Equivalent to mathematical ⌈x⌉ (ceiling function). @param number the nu

Main method used for counting the connected components. Iterates through the array of nodes to do a depth first search to get all nodes of the graph f

This function will calculate the number of uniform numbers between a and b @param a lower bound of range @param b upper bound of range @return the co

@brief Adds an element to the tail of the queue, blocking if full @param item the element to add @throws InterruptedException if the thread is interru

Finds all bridge edges in an undirected graph. <p>The graph is represented as an adjacency list where each vertex is identified by an integer in the

Returns a copy of the scores array. @return A copy of the scores array.

Increments the counter for the current node.

Inserts an element at the specified position in the array. <p> Creates a new array with size = original array size + 1. Elements at positions &lt;= in

If you sort the subarray from index left to right, what would be the k-th smallest element? This query is also commonly known as the quantile query.

Calculates the nth Leonardo Number using an iterative approach. <p> This method provides better performance than the recursive version for large value

Sorts the given stack in ascending order using recursion. The sorting is performed such that the largest element ends up on top of the stack. This met

Vector addition @param vector The vector to be added. @return The sum-vector.

Adds an element to the end of the array. If the array is full, it creates a new array with double the size to accommodate the new element. @param ele

This method returns a list of the vertices in a breadth first order beginning with the specified vertex @param startVertex the vertext to begin the t

This method checks the parity of the given number. @param n the number to check the parity of @return true if the number has even parity, false other

Deletes an element at the specified position from the array. <p> Creates a new array with size = original array size - 1. Elements after the deletion

This method returns a list of the vertices in a depth first order beginning with the specified vertex @param startVertex the vertex to begin the trav

Calculates the nth term in the Fibonacci sequence using recursion. @param n the position in the Fibonacci sequence (must be non-negative) @return the

Generic method to perform binary search on any comparable type. This is the main entry point for binary search operations. <p>Example Usage: <pre> In

Finds any integer solution to the linear Diophantine equation ax + by = c. <p> The method returns one of three types of solutions: <ul> <li>A specific

This method returns a polynomial in x computed modulo n @param base Integer base of the polynomial @param modulus Integer is value which is to be use

@return True if there is a next node, otherwise false.

Converts an integer to its Roman numeral representation. Steps: <ol> <li>Iterate over the Roman numeral values in descending order</li> <li>Ca

Checks if the given integer is a power of four. A number is considered a power of four if: 1. It is greater than zero 2. It has exactly one '1' bit i

Calculates the nth Leonardo Number using recursion. <p> Time Complexity: O(2^n) - exponential due to repeated calculations Space Complexity: O(n) - du

Computes the maximum subarray sum using Kadane's Algorithm and checks if it matches a predicted answer. @param a The input array of inte

Multiplies this complex number by another. @param z The number to be multiplied. @return The product.

Returns the 1's complement of a binary string. @param binary A string representing a binary number (e.g., "1010"). @return A string representing the

What is the 0-based index of the k-th occurrence of the number x in the array? @param x the number to search for @param k the occurrence count (1-bas

Returns the size of the deque @return the size of the deque

A method to insert a new value in BST. If the given value is already present in BST the insertion is ignored. @param data the value to be inserted

Adds a new process to the highest priority queue (queue 0). @param p The process to be added to the scheduler

Calculate a^p using binary exponentiation [Binary-Exponentiation](https://cp-algorithms.com/algebra/binary-exp.html) @param a the base for exponentia

Performs a binary search on a 2D sorted array to find the target value. The array must be sorted in ascending order in both rows and columns. @param

Helper to build a symmetric adjacency list for an undirected graph.

Converts a number from a source base to a destination base. @param sourceNumber The number in the source base (as an integer). @param sourceBase The

Performs the Euler primality test for a given number. @param n number to test (must be > 2 and odd) @param trials number of random bases to test

Solves the 0/1 Knapsack problem using Dynamic Programming (bottom-up approach). @param weightCapacity The maximum weight capacity of the knapsack. @p

@param a basis @param b exponent @param c modulo @return (a^b) mod c

Inserts the specified element (O(log n)). @throws NullPointerException if {@code e} is null @throws ClassCastException if {@code cmp == null} and {@co

Checks what's at the front of the queue @return element at the front of the queue

Subtract two points on the elliptic curve.

Returns the sum of elements from index left to right (inclusive) using the provided prefix sum array. @param prefixSum The prefix sum array computed

Merges the sets containing the two given nodes using union by size. The root of the smaller set is attached to the root of the larger set. @param x a

Adds an element to the G-Set. @param e the element to be added

@brief Removes and returns the element at the head of the queue, blocking if empty @return the element at the head of the queue @throws InterruptedExc

Divides this complex number by another. @param z The divisor. @return The quotient.

Sets an eviction listener to be notified when entries are evicted from the cache. @param listener a {@link BiConsumer} that accepts evicted keys and

Generate a 2D array of blended noise values normalized to [0, 1]. @param width width of the noise array (columns) @param height height of

Returns all possible dice roll combinations that sum to the target @param target the target sum to achieve with dice rolls @return list of all possib

Retrieves the minimum element in the stack. @return The minimum element.

Returns the counter wrongMess @return wrongMess, the number of Wrong Messages

Returns the first (head) value of the deque WITHOUT removing @return the value of the head of the deque, or null if empty

Retrieves and removes the element at the front of the queue. @return The element removed from the front of the queue, or {@code null} if the queue is

Removes and returns the minimum element (O(log n)), or {@code null} if empty.

Prints the elements of a list to standard output. @param listToPrint the list to print

Pushes an item onto the stack. @param item the item to be pushed onto the stack

Associates the specified value with the specified key in the cache. If the key already exists, its value is updated and the entry is moved to the most

Dequeue the element with the max priority from PQ @return The element removed

Converts a Roman numeral string to its integer equivalent. Steps: <ol> <li>Iterate over the string from right to left.</li> <li>For each chara

Calculates the sum of the sub-matrix defined by (row1, col1) to (row2, col2). Indices are 0-based. @param row1 Top row index. @param col1 Left column

Adds an item to the heap, maintaining the heap property. @param item the item to be added

Computes the arithmetic mean (average) of the given numbers. <p> The arithmetic mean is calculated as: (x₁ + x₂ + ... + xₙ) / n </p> <p> Example: For

Calculates the n-th Bell number using the Bell Triangle. @param n the index of the Bell number (must be non-negative) @return the n-th Bell number @t

Converts an octal number to its binary representation. <p>Each octal digit is individually converted to its 3-bit binary equivalent, and the binary d

Initialize a list with natural order values with pre-defined length @param length @return linked list with pre-defined number of nodes

Encodes the given byte array to a Base64 encoded string. @param input the byte array to encode @return the Base64 encoded string @throws IllegalArgum