Performs the forward Burrows-Wheeler Transform on the input string. <p> The algorithm generates all cyclic rotations of the input, sorts them lexicogr

The function "twoSum" takes an array of integers and a target integer as input, and returns an array of two indices where the corresponding elements i

Update the value of given range with the given value diff in O(log n) time. @param left The left index of the range to update. @param right The right

Calculates the velocity with respect to the moving frame. @param v1 The velocity of the object with respect to laboratory frame (m/s). @param v The v

Assign a task to a specific agent. @param agentName the name of the agent @param task the task to be assigned

Number of bytes not yet been read

This method returns the number of ways in which k objects can be chosen from n objects @param totalObjects Total number of objects @param numberOf

Swaps two bits at specified positions in an integer. @param data The input integer whose bits need to be swapped @param posA The position of the firs

Calculates the electrostatic force vector exerted by one charge on another. The returned vector is the force on the second charge (q2). @param q1 Cha

Computes the Jacobi symbol (a/n), which is a generalization of the Legendre symbol. @param a the numerator @param num the denominator (must be an odd

Checks for extra or redundant brackets in a given expression. @param expression the string representing the expression to be checked @return true if

Checks if the given key is present in the hash table. @param key the key to be checked @return true if the key exists, false otherwise

Removes all entries from the cache, regardless of their expiration status. <p>This method clears the internal cache map entirely, resets the hit-and-

Clears the lowest set bit of the given number. For example, if n = 18 (binary: 10010), the result will be 16 (binary: 10000). @param n the number who

Find all combinations of given array using backtracking @param arr the array. @param n length of combination @param <T> the type of elements in the ar

Helper method to convert a list of matching pairs into a sorted 2D array. Sorting ensures consistent ordering of pairs and vertices for easier compari

Discrete correlation function. Correlation between two discrete variables is calculated according to the formula: Cor(x, y)=Cov(x, y)/sqrt(Var(x) Var(

Returns an array where each element is the count of distinct elements in the corresponding window of size k. @param arr the input array @param k th

Creates a loop in a linked list by connecting the next pointer of a node at a specified starting position (position2) to another node at a specified d

Deletes the key-value pair associated with the specified key from the hash map. @param key the key whose key-value pair is to be deleted

Delete the node containing the minimum key in the heap updates new min @post (numOfnodes = = $prev numOfnodes - 1)

DFS (recursive) that records the order of first visit starting at {@code start}, but only recurses to a child when <b>all</b> its predecessors have be

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

Creates an empty ImmutableHashMap. @param <K> key type @param <V> value type @return empty ImmutableHashMap

Encodes a given string into a zig-zag pattern. @param s the input string to be encoded @param numRows the number of rows in the zigzag pattern

Encrypts a certain String with the Columnar Transposition Cipher Rule @param word Word being encrypted @param keyword String with keyword being used

Loops through all the steps until xEnd is reached, adds a point for each step and then returns all the points @param xStart First x-value. @param xEn

Evaluates the given postfix expression and returns the result. @param expression The postfix expression as a string with operands and operators separ

This method implements the extended Euclidean algorithm. @param a The first number. @param b The second number. @return An array of three integers:

Method to find a Node with a certain value @param key Value being looked for @return The node if it finds it, otherwise returns the parent

Calculates the gamma parameter that is of paramount importance in relativity theory. It is a dimensionless parameter that is equal to 1 for zero veloc

Function to generate array of double values, with predefined size. @param size result array size @return array of Double values, randomly generated,

Generates a list of all prime numbers up to the specified limit using the Sieve of Atkin algorithm. @param limit the upper bound up to which primes a

Returns the value to which the specified key is mapped, or null if this cache contains no mapping for the key. @param key the key whose associated va

Function to calculate the aliquot sum of an integer number @param n a positive integer @return aliquot sum of given {@code number}

@return The total horizontal distance traveled (meters).

@return The maximum vertical height from the ground (meters).

Approach 1: Uses a dynamic programming array to store the maximum sum at each index. Time Complexity: O(n) - where n is the length of the input array.

Approach 2: Optimized space complexity approach using two variables instead of an array. Time Complexity: O(n) - where n is the length of the input ar

Return element at special index. @param index given index of element @return element at special index.

Returns the number of vertices in the graph. @return the number of vertices

Returns whether the number was found in the segment. @return true if the number was found, false otherwise

gets the AES encryption key. In your actual programs, this should be safely stored. @return secKey (Secret key that we encrypt using it) @throws NoSu

@return The total time the projectile is in the air (seconds).

Returns the counter wrongMessCaught @return wrongMessCaught, the number of wrong messages, which are caught by the CRC algoriithm

Returns the counter wrongMessNotCaught @return wrongMessNotCaught, the number of wrong messages, which are not caught by the CRC algorithm

Calculates the Hamming distance between two integers. The Hamming distance is the number of differing bits between the two integers. @param x The fir

Checks if there are more elements to iterate over. @return {@code true} if there are more elements; {@code false} otherwise

return a sorted list by traversing the tree elements using inorder traversal

Checks whether 2 numbers are AmicableNumbers or not.

Checks if the binary representation of a number is a palindrome. @param x The number to check. @return True if the binary representation is a palindr

Helper method to check if a color is unassigned @param color the color to check @return {@code true} if the color is unassigned, {@code false} otherw

Checks whether the stack is empty. @return {@code true} if the stack has no elements, {@code false} otherwise

@brief Checks if the queue is full @return true if the queue has reached its capacity

Determines whether there exists a subset of the given array that adds up to the specified sum. This method uses a space-optimized dynamic programming

Schedules jobs to maximize profit while respecting their deadlines and arrival times. This method sorts the jobs in descending order of profit and at

This method prints juggler sequence starting with the number in the parameter @param inputNumber Number from which juggler sequence is to be started

Compute up to k loopless shortest paths from src to dst using Yen's algorithm. @param weights adjacency matrix; weights[u][v] = -1 means no edge; oth

This method finds the length of the longest substring without repeating characters. @param s is the input string @return the length of the longest su

Finds the maximum values in each sliding window of size k. @param nums The input array of integers @param windowSize The size of the sliding window @

Finds the maximum matching in a general graph (Edmonds Blossom Algorithm). @param edges A list of edges in the graph. @param vertexCount The number o

Calculates the minimum number of scalar multiplications needed to multiply a chain of matrices. @param p an array of integers representing the dimens

This method finds the minimum number of coins needed for a given amount. @param coins The list of coins @param amount The amount for which we need to

@brief Computes the modular inverse of a number with respect to a modulus using the Extended Euclidean Algorithm. @param a The number for which to fin

Returns the index representing the negation of the given variable. <p> Mapping rule: </p> <pre> For a variable i: negate(i) = i + n For a negate

Finds the next higher power of two. @param x The given number. @return The next higher power of two.

Finds the next lower power of two. @param x The given number. @return The next lower power of two.

Getter for `this.vertexCount` @return the number of vertices in the graph

Calculates the no. of distinct ways to climb a staircase with n steps. @param n the no. of steps in the staircase (non-negative integer) @return the

Returns the element at the front of the queue without removing it. @return the element at the front of the queue @throws IllegalStateException if the

Returns the item at the top of the stack without removing it. @return the item at the top of the stack, or {@code null} if the stack is empty @throws

Removes the top element from the stack.

If data is present in BST delete it else do nothing. @param data the value to be removed

A method to delete the node in BST. If node is present it will be deleted @param data the value that needs to be deleted

Performs a right rotation on the given array by the specified number of positions. @param arr the array to be rotated @param k the number of position

Move {@code n} characters in front of given string to the end of string time complexity: O(n) space complexity: O(n) @param s given string @param n t

Rounds a number to the nearest integer. @param x the input number @return the nearest integer value as a double

The run method for the thread, performing the linear search in its segment.

Schedules the tasks randomly and returns the randomized order. @return A list representing the tasks in their randomized execution order.