Checks if a String is considered a Pangram @param s The String to check @return {@code true} if s is a Pangram, otherwise {@code false}

Solves the 0-1 Knapsack problem using a recursive brute-force approach. @param w the total capacity of the knapsack @param wt an array where wt[i]

Returns the longest palindromic subsequence of the given string. @param original the input string @return the longest palindromic subsequence @throws

Returns a list of majority element(s) from the given array of integers. @param nums an array of integers @return a list containing the majority eleme

Computes the maximum flow from {@code source} to {@code sink} in the provided capacity matrix. @param capacity the capacity matrix representing the d

Removes and returns the element from the top of the stack. Shrinks the stack if its size is below a quarter of its capacity, but not below the default

Test if the value key is present in the list. @param key the value to be searched. @return {@code true} if key is present in the list, otherwise {@co

Solves range sum queries using Mo's Algorithm @param arr the input array @param queries array of queries to process @return array of results correspo

Recursively updates a point in the 2D grid.

This method returns a string obtained by XOR-ing two strings of same length passed a method parameters @param String a and b are string objects which

Computes the Needleman–Wunsch global alignment score between two strings. @param s1 the first string @param s2 the second string @param matchScore sc

Solves the Traveling Salesman Problem (TSP) using brute-force approach. This method generates all possible permutations of cities, calculates the tota

Computes the prefix sum array for efficient range queries. @param nums The input integer array. @return Prefix sum array where prefixSum[i+1] = sum o

Calculates the total energy of the pendulum. E = (1/2) m L^2 omega^2 + m g L (1 - cos(theta)) We use m = 1 for simplicity. @param state the current s

Calculates the frequency and probability range for each character in the input string in a deterministic order. @param text The input string. @return

Calculates the Turn Around Time (TAT) for each process. <p>Turn Around Time is calculated as the total time a process spends in the system from arriv

Returns the list of coins used to make the given amount using a greedy algorithm with standard denominations. <p>Time Complexity: O(n log n) where n

Compresses a string using the LZW algorithm. @param uncompressed The string to be compressed. Can be null. @return A list of integers representing th

Solves the 0-1 Knapsack problem using the bottom-up tabulation technique. @param values the values of the items @param weights the weights of the item

Converts a value from one unit to another. @param inputUnit the unit of the input value. @param outputUnit the unit to convert the value into. @param

Counts the number of bits that need to be flipped to convert a to b Algorithm: 1. XOR a and b to get positions where bits differ 2. Count the number

Alternative implementation using Long.bitCount(). @param a the source number @param b the target number @return the number of bits to flip to convert

Counts the number of subarrays whose sum equals k. @param nums The input integer array. @param k The target sum. @return The number of continuous

Converts a Decimal number to an Octal number. @param decimal The Decimal number as an integer. @return The Octal equivalent as an integer.

Decrypts the given ciphertext (in hexadecimal format) using the XOR cipher with the specified key. The result is the original plaintext. @param ciphe

Decrypts a ciphertext using the private key. @param cipher The CipherText (a, b). @param x The private key. @param p The prime modulus. @re

Detects the presence of a loop in the linked list using Floyd's cycle-finding algorithm, also known as the "tortoise and hare" method. @param head th

Prints the contents of the list in reverse order

Solves the Traveling Salesman Problem (TSP) using dynamic programming with the Held-Karp algorithm. @param distanceMatrix A square matrix where eleme

Encrypts the given plaintext using the XOR cipher with the specified key. The result is a hexadecimal-encoded string representing the ciphertext. @pa

Jump Search algorithm implementation. @param array the sorted array containing elements (must be sorted in ascending order) @param key the element

This method performs Saddleback Search @param arr The Sorted array in which we will search the element. @param row the current row. @param col the

@param array is an array where the LowerBound value is to be found @param key is an element for which the LowerBound is to be found @param <T> is any

@param arr The Sorted array in which we will search the element. @param value The value that we want to search for. @return The index of the element

Finds the coloring of the given graph using the Welsh-Powell algorithm. @param graph the input graph to color @return an array of integers where each

Finds a Hamiltonian Cycle for the given graph. @param graph Adjacency matrix representing the graph G(V, E), where V is the set of verti

Finds the minimum cut in the given undirected, weighted graph. @param graph An adjacency matrix representing the graph. graph[i][j] is the weight of

Generates Shannon-Fano codes for the symbols in a given text. @param text The input string for which to generate codes. Must not be null. @return A m

Generates a random password with a length between minLength and maxLength. @param minLength The minimum length of the password. @param maxLength The

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

Returns the current number of keys in the hash table. @return the number of keys present in the hash table

Get the color at the given co-odrinates of a 2D image @param image The image to be filled @param xCoordinate The x coordinate of which color is to be

Returns the number of elements in the queue @return number of elements in the queue

Converts a Hexadecimal number to a Decimal number. @param hex The Hexadecimal number as a String. @return The Decimal equivalent as an integer.

Computes the single geometric intersection point between two non-parallel segments when it exists. <p>For parallel/collinear overlap, this method ret

Returns true if the queue is empty. @return True if the queue is empty.

Isolates the lowest set bit of the given number. For example, if n = 18 (binary: 10010), the result will be 2 (binary: 00010). @param n the number wh

Returns the length of the last word in the specified string. <p>The method iterates from the end of the string, skipping trailing spaces first, and t

Determines if the given pattern matches the input string using backtracking. @param pattern The pattern to match. @param inputString The string to ma

Merges overlapping intervals from the given array of intervals. The method sorts the intervals by their start time, then iterates through the sorted

Merges two sorted singly linked lists into a single sorted singly linked list. <p>This method does not modify the input lists; instead, it creates a

Sets the {@link Random} instance to be used for random eviction selection. @param r a non-null {@code Random} instance @return this builder instance

Removes the element at a specified logical index from the list. @param index the logical index of the element to remove

Removes duplicate characters from the given string. @param input The input string from which duplicate characters need to be removed. @return A strin

Recursively solve the Tower of Hanoi puzzle by moving discs between poles. @param n The number of discs to move. @param startPole

Returns the current number of elements in the queue. @return the number of elements currently in the queue

Gets the number of key-value pairs in the hash map. @return the number of key-value pairs in the hash map

Sorts the given array in ascending order using a PriorityQueue. @param arr the array to be sorted @return the sorted array (in-place)

This function calculates the floor of square root of a number. We use Binary Search algorithm to calculate the square root in a more optimised way. @

Performs the forward Move-to-Front transform. <p> Converts the input string into a list of integers, where each integer represents the position of the

updateSize -> updates the subtree size of the current node

@return ciphertext XOR key

Getter for the adjacency matrix @return the adjacency matrix

Computes the Smith–Waterman local alignment score between two strings. @param s1 first string @param s2 second string @param matchScore score for a m

Converts a BCD (Binary-Coded Decimal) number to a decimal number. <p>Steps: <p>1. Validate the BCD number to ensure all digits are between 0 and 9. <p

Calculates the speed required for a stable circular orbit. @param centralMass The mass of the central body (kg). @param radius The radius of the orbi

Calculates the speed required for a stable circular orbit of a charged particle around a central charge (e.g., an electron orbiting a nucleus). @para

The above method can exceed limit of long (overflow) when factorial(n) is larger than limits of long variable. Thus even if nCk is within range of lon