Converts all the characters in this {@code String} to upper case. @param s the string to convert @return the {@code String}, converted to uppercase.

Counts the number of disjoint sets. @return the number of disjoint sets

Sets the default time-to-live (TTL) in milliseconds for cache entries. @param ttlMillis the TTL duration in milliseconds; must be >= 0 @return this b

Finds all intersection points among a set of line segments. <p>An intersection point is reported when two or more segments cross or touch. For overla

Finds and returns the representative (root) of the set containing the given node. This method applies path compression to flatten the tree structure f

Inserts a key into the hash table using cuckoo hashing. If the target bucket is occupied, it relocates the existing key and attempts to insert it into

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

Merges the sets containing the two given nodes. Union by rank is used to attach the smaller tree under the larger one. If both sets have the same rank

Adds the specified element to the set. @param element the element to add

Decompresses a list of LZ78 tokens back into the original string. @param compressedData The list of {@link Token} objects. Must not be null. @return

@return the top element in the heap, the one with lowest key for min-heap or with the highest key for max-heap @throws EmptyHeapException if heap is e

Calculates the area of a triangle using Heron's Formula. <p> Given three side lengths a, b, and c, the area is computed as: Area = √(s(s - a)(s - b)(s

Find minimum number of perfect squares that sum to n @param n the target number @return minimum number of squares needed

Compresses the input text using the LZ78 algorithm. @param text The input string to compress. Must not be null. @return A list of {@link Token} objec

Compresses the input text using the LZ77 algorithm. @param text The input string to compress. Must not be null. @param windowSize The size of the sli

@param o : an object to compare with the current element @return true if the keys on both elements are identical and the additional info objects are i

Creates a node (of type HeapNode) which contains the given key, and inserts it into the heap. @pre key>=0 @post (numOfnodes = = $prev numOfnodes + 1)

Checks whether a given number is a Kaprekar number. <p> The algorithm works as follows: <ol> <li>Square the number</li> <li>Split the squared number i

Calculates the median of an array of integers. The array is sorted internally, so the original order is not preserved. For arrays with an odd number o

Multiply a point by a scalar (repeated addition).

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

Returns the key value of the element. @return the key of the element

Inserts an element in it's appropriate place @param value Value to be inserted

Checks whether the array is sorted in ascending order. @param array the array to check @return true if the array is sorted in ascending order, false

Creates a new disjoint set containing the single specified element. @param value the element to be placed in a new singleton set @return a node repres

Finds the maximum element in the given array. @param <T> the type of elements in the array, which must implement the Comparable interface @param arra

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

Adds an edge to the graph. @param graph the adjacency list representing the graph @param from the source vertex of the edge @param to the destination

Returns the next element in the iteration. @return the next element in the bag @throws NoSuchElementException if there are no more elements to return

Schedules the next task based on the priority and wait time. The priority of a task increases with the time it spends waiting. @return name of the ne

@param arr is the input array @return shortest segment in the array which has gcd equal to 1. If no such segment exists or array is empty, returns emp

Attempts to allow a request based on the available tokens. If a token is available, it decrements the token count and allows the request. Otherwise, t

The most significant part of the CRC algorithm. The message is divided by P, so the dividedMessage ArrayList<Integer> is created. If check == true, th

Method to allocate memory to blocks according to the first fit algorithm. It should return an ArrayList of Integers, where the index is the process ID

Returns the current {@link EvictionStrategy} used by this cache instance. @return the eviction strategy currently assigned to this cache

Returns an iterator over the elements in this bag. <p>The iterator provides a way to traverse the elements in the order they were added. @return an

Performs a circular left rotation (left shift) on a 32-bit integer. Bits shifted out from the left side are inserted on the right side. @param value

Sets the scores array for the game tree. @param scores The array of scores. Length must be a power of 2. @throws IllegalArgumentException if the scor

Computes the Two's Complement of the given binary string. Steps: 1. Compute the One's Complement (invert all bits). 2. Add 1 to the One's Complement t

Decompresses a list of LZ77 tokens back into the original string. @param compressedData The list of {@link Token} objects. Must not be null. @return

Finds the highest (most significant) set bit in the given integer. The method returns the position (index) of the highest set bit as an {@link Optiona

Inserts a new element into the Leftist Heap. @param a the element to be inserted

Associates the specified value with the specified key in this map. If the map previously contained a mapping for the key, the old value is replaced.

Adds the specified value to the tail of the deque @param val Value to add to the deque

Calculates PageRank using the default damping factor and iterations @param totalNodes the total number of nodes @return array of PageRank values

Computes GCD of two long values using Stein's algorithm (binary GCD). <p>Handles negative inputs. If either input is {@code Long.MIN_VALUE} the method

Retrieves the value associated with the specified key. @param key the key whose associated value is to be returned @return the value associated with

Insert a key into the SplayTree. @param key The key to insert.

Calculate the nth Lucas number using recursion. Time Complexity: O(2^n) - exponential due to recursive calls Space Complexity: O(n) - recursion depth

Calculate the nth Lucas number using iteration. Time Complexity: O(n) - single loop through n iterations Space Complexity: O(1) - constant space usage

Reverse character array @param values character array @param from begin index of given array @param to end index of given array

Adds a clause of the form (a ∨ b) to the boolean expression. <p> Example: To add (¬x₁ ∨ x₂), call: </p> <pre>{@code addClause(1, true, 2, false); }<

Adds a directed edge from one vertex to another in the adjacency list. If the vertex does not exist, it will be added to the list. @param from the st

Returns true if this map contains a mapping for the specified key. @param key the key whose presence in this map is to be tested @return true if this

Decodes the given Base64 encoded string to a byte array. @param input the Base64 encoded string to decode @return the decoded byte array @throws Ille

Sets the eviction strategy used to determine when to clean up expired entries. @param strategy an {@link EvictionStrategy} implementation; must not b

Performs sentinel linear search on the given array. @param array the array to search in @param key the element to search for @param <T> the type of e

get the greatest common divisor @param num1 the first number @param num2 the second number @return gcd

Converts a non-negative integer to its English word representation. @param number the integer to convert (0-2,147,483,647) @return the English word r

Checks if a number is prime or not @param n the number @return {@code true} if {@code n} is prime

Checks if the given element is present in the G-Set. @param e the element to be checked @return true if the element is present, false otherwise

Called on each cache access (e.g., {@link RRCache#get(Object)}) to optionally trigger eviction. @param cache the cache instance on which this strateg

Removes and returns the first (head) value in the deque @return the value of the head of the deque @throws NoSuchElementException if the deque is emp

How many times does the number x appear in the array from index 0 to i (inclusive)? @param x the number to search for @param i the end index (0-based

Returns the number of key-value pairs in this map. @return the number of key-value pairs

Solves the linear system Ax = b using the Chebyshev iteration method. <p> NOTE: The matrix A must be symmetric positive-definite (SPD) for this algor

add in BST. if the value is not already present it is inserted or else no change takes place. @param data the value to be inserted

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

Extracts and removes the minimum element from the heap. @return the minimum element in the heap, or -1 if the heap is empty

Get head of the list. @return head of the list.

Compares two elements to see if the first is greater than the second. @param firstElement the first element to compare @param secondElement the seco

Inserts a new key into the min-priority queue. @param key the value to be inserted

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