* In the intro interview I was asked how to check if a given tree is a subtree of other tree * Given a function that returns an random integer value between 1 and 2 (with the same probability), build a function that returns an random integer between 1 and 3 (also with the same probability) * Write the code to serialize and deserialize a tree * How would you implement an "infinity scroll" feature in a web app? (discuss design, implementation issues, etc) * How would you implement an image service? (again; discuss design, implementation issues, etc) * Implement a divide & conquer pow function without recursion * Write a program to sort a several terabytes sized file in a machine that only has 2 Gb of ram * Given a file with N words, return the minimum number of words such that, together these words, contain all the alphabet letters * Write an algorithm to efficiently solve a crossword puzzle (here is when I failed) Of course, you have to always give the complexity of the solutions you proposed and try to find the optimal one.
