We have only defined the nth Fibonacci number in terms of the two before it. Now, we will look at Binet's formula to calculate the nth Fibonacci numbe

This method finds the nth fibonacci number using bottom up @param n The input n for which we have to determine the fibonacci number Outputs the nth f

This method finds the nth fibonacci number using memoization technique @param n The input n for which we have to determine the fibonacci number Outpu

This method finds the nth fibonacci number using bottom up @param n The input n for which we have to determine the fibonacci number Outputs the nth f

Case sensitive version version of the algorithm @param pattern the pattern to be searched for (needle) @param text the text being searched in (haysta

Finds all paths from the top-left to the bottom-right of the given maze. @param maze an {@code n x n} binary matrix where {@code 1} = open, {@code 0}

Iteratively fill the 2D image with new color @param image The image to be filled @param x The x coordinate at which color is to be filled @

get greatest common divisor @param a the first number @param b the second number @return gcd

Random messages, consisted of 0's and 1's, are generated, so that they can later be transmitted

Gets the next node in the linked list. @return the next node in the linked list

Inserts a value into the threaded binary tree. Duplicate values are inserted to the right subtree (consistent deterministic rule). @param value the i

Checks if the circular buffer is empty. This method is based on the current size of the buffer. @return {@code true} if the buffer is empty, {@code f

Calculates the nth term of the Jacobsthal Sequence. @param n the index of the sequence (must be non-negative) @return the nth term of the Jacobsthal

find the starting index in string haystack[] that matches the search word P[] @param haystack The text to be searched @param needle The pattern to

Creates a graph with the specified number of vertices and edges. @param numberOfVertices the total number of vertices @param listOfEdges a 2D array r

Finds the maximum product of any contiguous subarray in the given array. @param nums an array of integers which may contain positive, negative,

Finds the minimum window substring of 's' containing all characters of 't'. @param s The input string to search within. @param t The string with requ

Computes the maximum flow in a flow network using the Ford-Fulkerson algorithm. @param vertexCount the number of vertices in the flow network @param

Calculates the nth term of the Padovan Sequence. @param n the index of the sequence (must be non-negative) @return the nth term of the Padovan Sequen

Calculates the nth term of the Perrin Sequence. @param n the index of the sequence (must be non-negative) @return the nth term of the Perrin Sequence

Executes Dijkstra's algorithm on the provided graph to find the shortest paths from the source vertex to all other vertices. The graph is represented

Solves the CSP to find the shortest path from the start node to the target node without exceeding the resource constraint. @param start the starting

Adds two binary strings and returns their sum as a binary string. @param a First binary string. @param b Second binary string. @return Binary string r

Approximates the definite integral of a given function over a specified interval using the Monte Carlo method with a fixed random seed for reproducibi

Once the message is transmitted, some of it's elements, is possible to change from 1 to 0, or from 0 to 1, because of the Bit Error Rate (ber). For ev

Decodes the given Base64 encoded string to a string using UTF-8 encoding. @param input the Base64 encoded string to decode @return the decoded string

Performs iterative binary search on a sorted array. @param array the sorted array @param key the element to search @param <T> type of elements (must

Computes the total weight of the Minimum Spanning Arborescence of a directed, weighted graph from a given root. @param numVertices the number of vert

Generates Huffman codes for all characters in the tree. @param root root node of the Huffman tree @return map of characters to their Huffman codes

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

Gets the key associated with this node. @return the key associated with this node

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

Returns a hash code value for the heap element. @return a hash code value for this heap element

Check if a number is a Fibonacci number. This is true if and only if at least one of 5x^2+4 or 5x^2-4 is a perfect square @param number the number @r

Checks if the circular buffer is full. The buffer is considered full when its size equals its capacity. @return {@code true} if the buffer is full, {

Checks whether a number is part of a sociable cycle of a given length. Starting from the given number, it follows the chain of proper divisor sums and

Checks if the given string has valid parentheses @param s the input string containing parentheses @return true if valid, false otherwise

Merges K sorted linked lists into a single sorted linked list. <p>This method uses a priority queue (min-heap) to repeatedly extract the smallest nod

Removes and returns the last (tail) value in the deque @return the value of the tail of the deque @throws NoSuchElementException if the deque is empt

Pushes an element onto the top of the stack. Resizes the stack if it is full. @param value the element to push

Returns a new ImmutableHashMap with the given key-value pair added. @param key key to add @param value value to associate @return new ImmutableHashMa

Recursively queries the sum in a submatrix.

Performs the Solovay-Strassen primality test on a given number. @param num the number to be tested for primality @param iterations the number of iter

Performs one time step using the RK4 method. @param state the current state [theta, omega] @param dt the time step size @return the new state after t

Computes the sum of two binary characters and a carry. @param a First binary character ('0' or '1'). @param b Second binary character ('0' or '1'). @p

Calculates the sum of elements in the range [left, right]. Indices are 0-based. @param left The starting index (inclusive). @param right The ending

This function uses the points in a given list (drawn at random) to return an approximation of the number π. @param pts List of points where each poin

Converts a binary String to its decimal equivalent using bitwise operators. @param binary The binary number to convert. @return The decimal equivalen

Converts a binary number to its decimal equivalent. @param binaryNumber The binary number to convert. @return The decimal equivalent of the binary nu

Check if the string is a palindrome or not. Convert all characters to lowercase and push them into a stack. At the same time, build a string Next, pop

OUTPUT : Input - {89,56,98,123,26,75,12,40,39,68,91} is same for all the 3 classes Output: [12 26 39 40 56 68 75 89 91 98 123] is same for all the 3 c

Converts a time value from one unit to another. @param timeValue the numeric value of time to convert; must be non-negative @param unitFrom the unit

Computes the convex hull using a recursive divide-and-conquer approach. Returns points in counter-clockwise order starting from the bottom-most, left-

Performs fast exponentiation to calculate (base^exp) % mod using the method of exponentiation by squaring. <p>This method efficiently computes the re

Finds the index of the specified key in a sorted array using Fibonacci search. @param array The sorted array to search. @param key The element to sea

Finds the index of the specified key in a sorted array using interpolation search. @param array The sorted array to search. @param key The value to s

To check if given value is present in tree or not. @param data the data to be found for

Finds an Eulerian Path or Circuit using Hierholzer’s Algorithm. @return list of vertices representing the Eulerian Path/Circuit, or an empty

Computes the geometric mean of the given numbers. <p> The geometric mean is calculated as: ⁿ√(x₁ × x₂ × ... × xₙ) </p> <p> Example: For numbers [2, 8]

Returns the counter correctMess @return correctMess, the number of the Correct Messages

Returns the n-th number that is a sum of powers of the given base. Example: base = 3 and n = 4 Ascending order of sums of powers of 3 = 3^0 = 1, 3^1 =

Returns the root of the Binary Tree @return the root of the Binary Tree

Conversion from the HSV-representation to the RGB-representation. @param hue Hue of the color. @param saturation Saturation of the color. @param valu

Performs the inverse Burrows-Wheeler Transform using the LF-mapping technique. <p> The LF-mapping (Last-First mapping) is an efficient method to recon

Checks whether a given number is an Armstrong number or not. @param number the number to check @return {@code true} if the given number is an Armstro

Checks if a number is a Disarium number. @param number the number to check (must be positive) @return true if number is Disarium, false otherwise @th

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

Checks whether there exists a pair of elements in a sorted array whose sum equals the specified key. @param arr a sorted array of integers in ascendi

Check if a number is perfect cube or not @param number number to check @return {@code true} if {@code number} is perfect cube, otherwise {@code false

Check if a number is perfect cube or not by using Math.cbrt function @param number number to check @return {@code true} if {@code number} is perfect

Checks if a vertex is already part of the current Hamiltonian path. @param vertex The vertex to check. @return {@code true} if the vertex is already

Finds the longest common substring of two strings. @param a First input string @param b Second input string @return The longest common substring, or

Checks if an element is in the LWWElementSet. An element is considered present if it exists in the addSet and either does not exist in the removeSet,

Returns the optimal score assuming that both players play their best. <p> This method recursively evaluates the game tree using the minimax algorithm

Returns the next character