Add an element to the tail of the linked list, O(1)

Add an element at a specified index

Adjusts the capacity of the hash table after it's been made larger. This is important to be able to override because the size of the hashtable control

Perform a breadth first search on a graph a starting node 'start'.

BFS example.

A iterative binary search function. It returns location of x in given array arr[l..r] if present, otherwise -1

A recursive binary search function. It returns location of x in given array arr[l..r] is present, otherwise -1

Do dfs to construct rooted tree.

Sets the i'th bit to zero

The recursive approach has the advantage that it does not have to visit all possible states like the tabular approach does. This can speedup things es

This method generates all bit sets of size n where r bits are set to one. The result is returned as a list of integer masks.

Check if a value is contained within the linked list

Sorts values in the range of [minVal, maxVal] in O(n+maxVal-maxVal)

Creates a graph with n nodes. The adjacency matrix is constructed such that the value of going from a node to itself is 0.

Helper method that performs a depth first search on the graph to give us the topological ordering we want. Instead of maintaining a stack of the nodes

Example usage of DFS

Run Dijkstra's algorithm on a directed graph to find the shortest path from a starting node to an ending node. If there is no path between the startin

Run Dijkstra's algorithm on a directed graph to find the shortest path from a starting node to an ending node. If there is no path between the startin

Helper method to find the rightmost node (which has the largest value)

Helper method to find the rightmost node (which has the largest value)

Helper method to find the leftmost node (which has the smallest value)

Finds the greatest common denominator of a and b.

Finds the greatest common divisor of a and b

Computes the Greatest Common Divisor (GCD) of a & b This method ensures that the value returned is non negative

Gets the zero base index position of the 1 bit in 'k'

Returns the capacity of the hashtable (used mostly for testing)

Computes the height of the tree, O(n)

Strictly increases the value associated with 'ki' to 'value'

Increases the capacity of the hash table.

Check if this binary tree is empty

Returns true/false depending on whether the hash-table is empty

Check if the stack is empty

Returns whether or not the queue is empty

Is this linked list empty?

Helper functions to make the code more readable.

Verifies if a number n is a power of two

Checks if the i'th is set

Checks if the i'th is set

Suppose there are n people in a circle and person 0 kill the k'th person, then the k'th person kills the 2k'th person and so on until only one person

* @param capacity - The maximum capacity of the knapsack * @param W - The weights of the items * @param V - The values of the items * @return

Finds the least common multiple of a and b

Returns a non unique Longest Common Substring between the strings str1 and str2 in O(nm)

Tests if the value of node i < node j

Finds the length of the longest increasing subsequence length, O(n^2)

The lowestOneBit returns an int value with at most a single one-bit, in the position of the lowest-order one-bit in the specified int value.

Returns the length of the longest paldindrome subsequence

Return the value of the maximum subarray in 'ar'

From the parent node at index i find the minimum child below it

Generates the next ordered permutation in-place (skips repeated permutations). Calling this when the array is already at the highest permutation retur

Converts a hash value to an index. Essentially, this strips the negative sign and places the hash value in the domain [0, capacity)

Add an element to the back of the queue

overloaded == operator