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

Reads a single byte from the stream

This solves the problem of removing elements quickly. Even though the worst case of 'remove' method is O(n), it is a very pessimistic view. We will ne

Deletes a given value from the Binary Tree @param value Value to be deleted @return If the value was deleted

Conversion from the RGB-representation to the HSV-representation. @param red Red-component of the color. @param green Green-component of the color. @

Subtracts a number from this complex number. @param z The number to be subtracted. @return The difference.

Converts a string to title case. @param input The string to convert @return The title-cased string, or empty string if input is null/empty. If in

Adds a value to all elements in the range [l, r]. <p> This method uses a branchless approach by allocating an extra element at the end of the array,

Checks if a particular vertex exists in a graph @param aVertex the vertex to check for existence @return whether or not the vertex exists

Adds an element to the set. @param element The element to be added.

Checks whether two numbers are Friendly Numbers. @param a First number (must be positive) @param b Second number (must be positive) @return true if a

Solves the 0/1 Knapsack problem using recursion. @param values the array containing values of the items @param weights the array containing weight

Counts how many numbers in the range [L, R] have a digit sum equal to the target. @param l The lower bound of the range (inclusive). @param r

Counts total number of set bits in all numbers from 1 to n Time Complexity: O(log n) @param n the upper limit (inclusive) @return total count of set

Decompresses a list of integers back into a string using the LZW algorithm. @param compressed A list of integers representing the compressed data. Ca

Removes and returns the element at the front of the queue. @return the element at the front of the queue. @throws NoSuchElementException if the queue

Prints contents of the list

Draws an anti-aliased line using Wu's algorithm. The algorithm produces smooth lines by drawing pairs of pixels at each x-coordinate (or y-coordinate

Encodes the given plaintext string into a binary string using the generated Huffman dictionary. @param text The plaintext string to compress. @return

Encrypts a message using the public key. @param message The message converted to BigInteger. @param p The prime modulus. @param g The gen

Generic Linear search method that searches for a value in the given array by checking each element one by one. @param array List to be searched (can

Return the node of the heap whose key is minimal. $ret == null if (empty==true)

@param n the zero-based-index of the queried ugly number @exception IllegalArgumentException n is negative @return the n-th ugly number (starting from

Returns the absolute value of a number. @param number The number to be transformed @return The absolute value of the {@code number}

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

Returns the Longest Common Subsequence (LCS) of two given strings. @param str1 The first string. @param str2 The second string. @return The LCS of th

Helper method to extract values from the linked list into an array for assertion.

Gets the solution coefficients. @return the solution

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

Inserts an element at the rear of the queue. @param element Element to be added. @return True if the element was added successfully, false if the que

Computes the intersection of two integer arrays, preserving element frequency. For example, given [1,2,2,3] and [2,2,4], the result will be [2,2]. St

Checks if a string is an isogram using boolean array approach. Time Complexity: O(n) Space Complexity: O(1) @param str the input string @return true

Checks if a string is an isogram using length comparison approach. Time Complexity: O(n) Space Complexity: O(k) where k is the number of unique charac

Finds all Kaprekar numbers within a given range (inclusive). @param start the starting number of the range (inclusive) @param end the ending number

Computes the LCP array using Kasai's algorithm. @param text the original string @param suffixArr the suffix array of the string @return the LCP

Finds the maximum sum of a subarray of size K consisting of distinct elements. The algorithm uses a sliding window technique with a frequency map to

Moves all '#' characters in the input string to the end. @param str the input string containing characters and '#' @return a new string with all '#'

Multiplies two matrices. @param matrixA the first matrix rowsA x colsA @param matrixB the second matrix rowsB x colsB @return the product of the two

Retrieves, but does not remove, the element at the front of the queue. @return The element at the front of the queue, or {@code null} if the queue is

Removes the top element from the stack. If the element is the minimum element, it is also removed from the {@code minStack}.

Pushes a new value onto the stack. Each entry stores both the value and the minimum value so far. @param value The value to be pushed onto the stack.

Computes the quadratic mean (root mean square) of the given numbers. <p> The quadratic mean is calculated as: √[(x₁^2 × x₂^2 × ... × xₙ^2)/n] </p> <p>

Remove an element from the front of the queue @return the new front of the queue

Shuffles the provided array in-place using the Fisher–Yates algorithm. @param arr the array to shuffle; must not be {@code null} @throws IllegalArgum

Returns the number of elements in the bag. @return the number of elements currently in the bag

Calculate sum of arithmetic series @param firstTerm the initial term of an arithmetic series @param commonDiff the common difference of an arithmetic

Applies the XOR operation between the input bytes and the key bytes. If the key is shorter than the input, it wraps around (cyclically). @param input

this method adds an edge to the graph between two specified vertices @param from the data of the vertex the edge is from @param to the data of the ve

Add a movie to the index. @param docId Unique identifier for the movie. @param name Name of the movie. @param imdbRating IMDb rating of the movie. @pa

Computes the arithmetic mean of a {@code double} array. <p>The average is calculated as the sum of all elements divided by the number of elements: {@

Calculates projectile trajectory using standard Earth gravity. @param initialVelocity Initial speed of the projectile (m/s). @param launchAngleDegree

Compares the G-Set with another G-Set to check if it is a subset. @param other the other G-Set to compare with @return true if the current G-Set is a

Compresses a string using the Arithmetic Coding algorithm. @param uncompressed The string to be compressed. @return The compressed representation as

Compresses a string using the Run-Length Encoding algorithm. @param text The string to be compressed. Must not be null. @return The compressed string

Calculates the nth Fibonacci number. @param n The index of the Fibonacci number to calculate. @return The nth Fibonacci number as a BigInteger. @thro

Checks if the set contains the specified element. @param element the element to check for @return true if the set contains the element, false otherwi

Converts the given input value using the affine transformation: result = slope inValue + intercept. @param inValue The input value to convert. @retur

Converts the input string using the Atbash cipher. Alphabetic characters are substituted with their opposite in the alphabet, while non-alphabetic cha

Convert a decimal number to another radix. @param number the number to be converted @param radix the radix @return the number represented in the new

Counts the number of inversions in the given array. @param arr The input array of integers. @return The total number of inversions in the array.

Returns the count of subarrays containing exactly k odd numbers. @param nums input array of integers @param k number of odd elements required in t

This method calculates the maximum obtainable value for cutting a rod of length n into different pieces, given the prices for each possible piece leng

Decodes the given binary string back into the original plaintext using the Huffman Tree. Validates the integrity of the binary payload during traversa

@brief Performs QR decomposition on a matrix using the Gram-Schmidt process @param matrix the input matrix (m x n) @return QR object containing orthog

Decompresses a string that was compressed using the Run-Length Encoding algorithm. @param compressedText The compressed string. Must not be null. @re

Finds all prime numbers up to n using the Sieve of Eratosthenes algorithm @param n the upper limit (inclusive) @return a list of all prime numbers fr

Returns the height of the game tree. @return The height of the game tree (log2 of the number of leaf nodes).

Returns the imaginary part of the complex number. @return The imaginary part of the complex number.

Calculates the maximum weighted matching for the tree, starting from the given root node. @param root The index of the root node of the tree. @param

Finds the absolute maximum value among the given numbers. @param numbers The numbers to compare. @return The absolute maximum value. @throws IllegalA

returns root node of the Treap

Increments the increment counter for the current node.

Checks whether two line segments intersect. @param p1 first endpoint of segment 1 @param p2 second endpoint of segment 1 @param q1 first endpoint of

Returns the inverse square root of the given number upto 6 - 8 decimal places. calculates the inverse square root of the given number and returns true

Performs the inverse Move-to-Front transform. <p> Reconstructs the original string from the list of indices produced by the forward transform. This re

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

Returns whether or not the deque is empty @return whether or not the deque is empty

Checks whether the given number is a Happy Number. Uses Floyd’s Cycle Detection algorithm (tortoise and hare method) to detect loops efficiently. @pa

Check if {@code n} is palindrome number or not @param number the number @return {@code true} if {@code n} is palindrome number, otherwise {@code fals