Returns the size of this stack. @return The number of elements in this stack.

Adds a key-value pair to the cache using the default time-to-live (TTL). <p>The key may overwrite an existing entry. The actual insertion is delegate

Tests if this stack is empty. @return {@code true} if this stack is empty; {@code false} otherwise.

Calculates the length of the linked list. @param head The head node of the linked list. @return The total number of nodes in the linked list.

Appends an element to the end of the list. @param element the element to append @throws NullPointerException if element is null

Inserts a word into the Trie. <p> The method traverses the Trie from the root, character by character, and adds nodes if necessary. It marks the last

Adds an element to the top of the stack. @param value The element to add.

Removes the element at the top of this stack and returns it. @return The element popped from the stack. @throws IllegalStateException if the stack is

Adds this complex number to another. @param z The number to be added. @return The sum.

Main method arrays sorting algorithms @param unsorted - an array should be sorted @return a sorted array

Removes the specified element from the set. @param element the element to remove

Returns the element at the top of this stack without removing it. @return The element at the top of this stack. @throws IllegalStateException if the

Adds an element to the bag. <p>This method adds the specified element to the bag. Duplicates are allowed, and the bag will maintain the order in whic

Retrieves the value associated with the specified key from the cache. <p>If the key is not present or the corresponding entry has expired, this metho

Adds an element to the bucket. @param element the element to add

Returns the smaller of two {@code int} values. That is, the result the argument closer to the value of {@link Integer#MIN_VALUE}. If the arguments hav

Returns a sequential stream with this collection as its source. @return a stream of the elements in the array

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

Finds the magnitude of the complex number. @return The magnitude.

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

@brief Removes and returns the element at the head without blocking @return the element at the head, or null if the queue is empty

Insert an element at the tail of the list @param data element to be added

Computes the full Damerau–Levenshtein distance between two strings. @param s1 the first string @param s2 the second string @return the minimum edit d

Checks if a number is a Harshad number. A Harshad number is a positive integer that is divisible by the sum of its digits. @param n the number to be

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

@brief Adds an element to the tail of the queue without blocking @param item the element to add @return true if the element was added, false if the qu

Checks if the bag contains a specific element. <p>This method uses the {@code equals} method of the element to determine membership. @param element

Computes the value of the base raised to the power of the exponent. <p> The method calculates {@code a}^{{@code b}} by iteratively multiplying

Checks if a given number is a Keith number. <p> The algorithm works as follows: <ol> <li>Extract all digits of the number and store them in a list</l

Swaps two elements at the given positions in an array. @param array the array in which to swap elements @param i the index of the first element t

Checks whether the given key exists in the map. @param key key to check @return true if key exists, false otherwise

Creates a binary tree with given values @param values: Level order representation of tree @return Root of a binary tree

Returns an array containing all elements in the bucket. @return an array containing all elements in the bucket

Encrypts the plaintext with the key and returns the result @param plainText which we want to encrypt @param key the key for encrypt @return Encrypted

Retrieves and removes the item at the front of the buffer (FIFO). This operation will move the {@code getPointer} forward. @return The item at the fr

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

Adds an item to the end of the buffer (FIFO). If the buffer is full, this operation will overwrite the oldest data. @param item The item to be added.

Add two points on the elliptic curve.

Decrypts the ciphertext with the key and returns the result @param cipherText The Encrypted text which we want to decrypt @return decryptedText

Retrieves the exact value at a specific leaf node. @param index The column index. @return The value at the given index.

Prints the elements of the queue.

@param x Source Vertex @param y End vertex @param z Weight

Finds the logical index of a specified element in the list. @param element the element to search for in the list @return the logical index of the ele

Finds the median of the elements between the specified range. @param arr the input array @param begin the starting index @param end the ending index

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 repre

@param key is an element which should be found @param array is an array where the element should be found @param <T> Comparable type @return first fou

Retrieves the maximum item from the heap without removing it. @return the maximum item

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 an element to the rear of the queue. @param data the element to insert. @throws IllegalArgumentException if data is null.

Parse a string to integer @param s the string @return the integer value represented by the argument in decimal. @throws NumberFormatException if the

Checks if a number is a Krishnamurthy number. <p> A number is a Krishnamurthy number if the sum of the factorials of its digits equals the number its

Returns the greater of two {@code int} values. That is, the result is the argument closer to the value of {@link Integer#MAX_VALUE}. If the arguments

Checks if an element might be in the Bloom filter. <p> This method checks the bits at the positions computed by each hash function. If any of these bi

Adds a new element to the queue. If the queue is full, an exception is thrown. @param value the element to be added to the queue @throws IllegalState

Converts all of the characters in this {@code String} to lower case @param s the string to convert @return the {@code String}, converted to lowercase

Inserts the specified key-value pair into the hash map. If the key already exists, the value is updated. @param key the key to be inserted @param v

Sets an edge in the adjacency matrix @param from source node (1-indexed) @param to destination node (1-indexed) @param value 1 if edge exists, 0

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

Searches for the value associated with the specified key in the hash map. @param key the key whose associated value is to be returned @return the val

Selects the {@code n}-th largest element of {@code list}, i.e. the element that would be at index n if the list was sorted. <p> Calling this function

Adds a building with the given left, height, and right values to the buildings list. @param left The left x-coordinate of the building. @param heig

Returns the largest (closest to positive infinity) @param number the number @return the largest (closest to positive infinity) of given {@code number

Adds a task to the scheduler with a given priority. @param name name of the task @param priority priority of the task

Retrieves the value associated with the given key from the cache. If the key exists, the node's frequency is incremented, and the node is repositioned

Inserts or updates a key-value pair in the cache. If the key already exists, the value is updated and its frequency is incremented. If the cache is fu

Inserts certain value into the Binary Tree @param value Value to be inserted

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

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

Inserts an element into the Bloom filter. <p> This method hashes the element using all defined hash functions and sets the corresponding bits in the b

insert a node into the Treap @param value value to be inserted into the Treap @return root of the Treap where the value is inserted