1) Given a string, return the length of the longest substring that does not contain any repeating characters.

1) Given a BST, return the nodes that are visible only from the right side. 2) Given an array of values and a target value, does there exist a series of subsets of the array such that the sum of all values in the subset equals to the target.

Given a tree, verify that on even levels, all values in the level are strictly increasing and even. On odd levels, verify all values in the level are strictly decreasing and odd.

Given a list of words, match all words with other words from the list that are a prefix for the word.

Given a list of lists in a lexigraphic ordering, return the ordering of the characters in the language.

1) Return a list of all the paths to leaves in the tree. 2) Given a lexicographically sorted list of words, return the order of the alphabet.

Print a linked list in reverse.

Given a linked list with an additional pointer referring to another node in the list, return a deep copy of the list.

1) Find the K nearest points to a vertex. 2) Change your solution under the condition that you have an input file of size 500 Petabytes.

1) Write a square root function. 2) Find the K closest points

1) Write a function to determine the coin closest to you from a list of positions using Manhattan Distance 2) Find the cutoff at which to switch over to a breadth first search algorithm 3) Determine which is the optimal coin to collect when there are opponents present (each opponent only collects one coin)

1) Write a function to reverse a given string 2) Given an unsorted array of unique integers (size n + 1) and a second array that is identical to the first array but missing one integer (size n), find and output the missing integer