Return the node that begins the intersection of two linked lists.

1) Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white, and blue. We will use the integers 0, 1, and 2 to represent the color red, white, and blue, respectively. 2) Given an array of Tree nodes, return the root node.

Given two strings s1 and s2, write a function to return true if s2 contains the permutation of s1. In other words, one of the first string permutations is the substring of the second string.

1) Count the amount of words in a string. 2) You are given a string s and an array of strings words of the same length. Return all starting indices of substring(s) in s that is a concatenation of each word in words exactly once, in any order, and without any intervening characters.

1) Design a system to rank products within categories by a rolling average of their purchase count.

1) Design an LRU cache. 2) Find the longest common prefix from an array of strings.

Find the sum of three values closest to the target.

Given an array of characters and a string, implement a function that finds the smallest substring containing all the characters in the array.

1) Given two linked lists, merge them into one such that their values are in sorted order. 2) Given a full binary tree, return an array containing the boundary elements from the left, then bottom, then right side, without duplicates.

1) Print the boundaries of a given tree. 2) Determine the optimal way to cut rods in order to maximize profits, given a map from rod length to price and a starting length of rod

Given a 2D matrix, where 1 represents land and 0 represents water, count how many islands are present

1) Find the next largest node in a BST given the root and the target node. 2) How would you modify this if you wanted to find the next smallest? How would you modify this if you were not given the root node?

Given a list of numbers representing the time to sleep, write a function to output the order when each thread sleeps for the given amount of time.

1) Given two strings, is one of the strings a rotated version of the other? 2) Given an array of numbers containing pairs of numbers, except for one single number, find the single number within the array. 3) Given a dollar amount and a list of denominations, find the count of the optimal way to make change.

1) Write a function that checks if a string is a strict palindrome. 2) Write a function that checks if a string is a palindromic phrase. That is, it ignores non-alphabetic characters and ignores case. 3) Write a function that deep copies a linked list, where each node contains data and a pointer to a different node. 4) Print a linked list in reverse order.

1) Reverse the order of the words in a string 2) Modify part 1 such that the punctuation stays in place while the words are reversed.

1) Check whether it is possible to partition an array. 2) Is there a way to get from one city to the other with the given bus routes?

Given a list of integers L, find the maximum length of a sequence of consecutive numbers that can be formed using elements from L.

1) Given a dictionary of words, determine whether it is possible to transform a given word into another with a fixed number of characters 2) Modify the approach so that transitions between varying quantities were possible 3) Modify the code to work as an API with lots of words added to the dictionary, but few tests 4) Determine the largest sum of a contiguous subarray

If it is possible, return any [i, j], such that * Z[0], Z[1], ..., Z[i] is the first part; * Z[i+1], Z[i+2], ..., Z[j-1] is the second part, and * Z[j], Z[j+1], ..., Z[Z.length - 1] is the third part. * All three parts have equal binary value.

Find pairs of values that sum up to a given value.

1) Given a list of points as [x,y] pairs; a vertex in [x,y] form; and an integer k, return the kth closest points in terms of Euclidean distance 2) Assuming that the dataset is too big to store in memory, rewrite functions for distributed system

Derive the order of the letters given a list of words

1) Given a value, return the optimal number of coins [1,5,10,25] to make the value. 2) Given a value and a set of coins, return the optimal count of coins to achieve the value

1) Write a function that takes a string as an input and returns a shuffled version of that string (i.e. a version where each character is just as likely to be in any given position) 2) Write a function that analyzes how well your previous function randomly shuffles the string

1) Given two strings s1 and s2, write a function that returns if the two strings are equal in a case-insensitive way 2) Expand the first function such that it returns True if the edit distance between s1 and s2 is 1 or lower 3) Expand the function to take a third parameter designating the comparision tolerance between s1 and s2 to be 'n' edit distances or lower

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

Given an integer array and number k, output all unique pairs that sum up to k. Example: for input [1, 3, 2, 5, 46, 6, 7, 4] and k = 4, output (1, 3).