Computes the n-th Tribonacci number. @param n the index of the Tribonacci number to compute @return the n-th Tribonacci number

Converts a decimal number to BCD (Binary-Coded Decimal). <p>Steps: <p>1. Check if the decimal number is within the valid range for BCD (0 to 9999). <p

Decompresses a BigDecimal number back into the original string. @param compressed The compressed BigDecimal number. @param length The

Delete an element in the heap. @param elementIndex int containing the position in the heap of the element to be deleted.

Calculates the determinant of a given matrix. @param a the input matrix @param n the size of the matrix @return the determinant of the matrix

Separates the digits of a large positive number into a list in reverse order. @param largeNumber The large number to separate digits from. @return A l

Executes the process for a given time slice. @param timeSlice The amount of time the process is executed

Finds the index of the specified key in a sorted array using exponential search. @param array The sorted array to search. @param key The element to s

Fill the 2D image with new color @param image The image to be filled @param x The x coordinate at which color is to be filled @param y The y coordina

Generates a Floyd Triangle with the specified number of rows. @param rows The number of rows in the triangle. @return A List representing the Floyd T

Generates a random key of the given length in bytes. @param length the length of the key in bytes, must be non-negative @return a new random key @thr

Generates random points for testing the Pi approximation. @param numPoints Number of random points to generate @return List of random points

Retrieves the key value of an element at the specified index. @param elementIndex 1-based index of the element @return double value representing the

Gets the GCD value. @return the GCD

Returns the maximum element present in the stack @return The element at the top of the maxStack, or null if the stack is empty.

Returns the minimum element present in the stack @return The element at the top of the minStack, or null if the stack is empty.

Get Node of given range in O(log n) time. @param left The left index of the range to update. @param right The right index of the range to update. @re

Reconstructs the final array using prefix sums. @return The resulting array after all updates. Returns long[] to handle potential overflows.

Returns the current number of elements in the array. @return the number of elements in the array

Computes the first hash index for a given key using the modulo operation. @param key the key for which the hash index is computed @return an integer

Computes the second hash index for a given key using integer division. @param key the key for which the hash index is computed @return an integer ind

Insert an element at the head @param x Element to be inserted

Linear interpolation between two values. @param a value at alpha = 0 @param b value at alpha = 1 @param alpha interpolation factor in [0, 1]

Evaluates the polynomial that passes through the given points at a specific x-coordinate. @param x The x-coordinates of the points. Must be the same

Iterative is BT balanced implementation

Recursive is BT balanced implementation @param root The binary tree to check if balanced

Method to check if the graph is bipartite. @param v Number of vertices in the graph @param adj Adjacency list of the graph @return True if the g

Helper method to verify if points are in counter-clockwise order. Uses the signed area method: positive area means CCW.

Checks if the queue is empty. @return true if the queue is empty, otherwise false.

@brief Checks if the queue is empty @return true if the queue contains no elements

Checks if the queue is empty. @return {@code true} if the queue has no elements; {@code false} otherwise.

Checks if the cache entry has expired. @return {@code true} if the current time is past the expiration time; {@code false} otherwise

Checks if the cache entry has expired. @return {@code true} if the current time is past the expiration time; {@code false} otherwise

Returns true if the queue is full @return true if the queue is full

Checks if the queue is full. @return {@code true} if the queue has reached its maximum capacity; {@code false} otherwise

Returns whether the given boolean formula is satisfiable. @return {@code true} if a solution exists; {@code false} otherwise @throws Error if called

Check if a number is strobogrammatic @param number the number to be checked @return true if the number is strobogrammatic, false otherwise

Executes Johnson's algorithm on the given graph. Steps: 1. Add a new vertex to the graph and run Bellman-Ford to compute modified weights 2. t the gra

Computes the maximum flow from source to sink using Dinic's algorithm. @param capacity square capacity matrix (n x n); entries must be >= 0 @param so

Returns the size of the maximum matching.

This method finds the maximum sum of a subarray of a given size k. @param arr is the input array where the maximum sum needs to be found @param k i

Merges the state of this G-Counter with another G-Counter. @param other The other G-Counter to merge with.

Returns the 128-bit BigInteger representation of the input of an array of 8-bit integers. @param cells that we need to merge @return block of merged

Returns the middle node of the list. @param head the head of the singly linked list; may be {@code null} @return the middle node (second middle for e

This method finds the minimum sum of a subarray of a given size k. @param arr is the input array where the minimum sum needs to be found @param k i

Converts the given string to a 32-bit signed integer. The conversion discards any leading whitespace characters until the first non-whitespace charact

Notifies the eviction listener, if one is registered, that a key-value pair has been evicted. <p>If the {@code evictionListener} is not {@code null},

Notifies the eviction listener, if one is registered, that a key-value pair has been evicted. <p>If the {@code evictionListener} is not {@code null},

Calculates the nth New Man Shanks prime and checks if it equals the expected answer. @param n the index of the New Man Shanks prime to calculate (0-b

Getter for `this.edgeCount` @return the number of edges

Removes and returns the item at the top of the stack. @return the item at the top of the stack, or {@code null} if the stack is empty @throws Illegal

Displays the tree is a structured format

Replaces an element in the array with the given item and returns the replaced item. @param <T> The type of elements in the array, which must be com

Resolve instantaneous elastic collision between two circular bodies. @param a first body @param b second body

Reverses the order of elements in the given stack using recursion. Steps: 1. Check if the stack is empty. If so, return. 2. Pop the top element from t

Performs a left rotation on the given array by the specified number of positions. @param arr the array to be rotated @param n the number of positions

Finds the shortest paths from a source vertex to all other vertices in a weighted graph. @param graph The graph represented as an adjacency list. @pa

Search for a key in the SplayTree. @param key The key to search for. @return True if the key is found, otherwise false.

Computes shortest distances from {@code src} in a graph whose edges have weight 0 or 1. @param n the number of vertices, labeled {@code 0..n-1} @para

Return the number of elements in the heap $ret == 0 if heap is empty

Solves range frequency queries using Mo's Algorithm Example: Count occurrences of a specific value in range [L, R] @param arr the input array @param

Solves the Sudoku puzzle using backtracking @param board 9x9 Sudoku board with 0 representing empty cells @return true if puzzle is solved, false oth

Sorts the array using the Dark Sort algorithm. @param unsorted the array to be sorted @return sorted array

Sorts the linked list using the QuickSort algorithm. The sorted list replaces the original list within the SinglyLinkedList instance.

representation of the input 128-bit block as an array of 8-bit integers. @param block of 128-bit integers @return array of 8-bit integers

Finds and returns the strongly connected components (SCCs) of the directed graph. @param v the number of vertices in the graph @param graph the adjac

Returns a string representation of this {@code ADTFraction} in the format {@code numerator}/{@code denominator}. @return A string representation of t

Retrieves the top element of the stack. @return The top element.

Returns an ArrayList containing the vertices of the graph arranged in topological order. Topological sorting ensures that for any directed edge (u, v)