The questions were mostly around algorithms fibonacci, tree traversal, sorting algorithms etc. The questions themselves were phrased typically in terms of hypothetical problems to which you would have to figure out which algorithm would be best suited to apply and explain on the whiteboard. These were then typically followed by questions around space-time complexity of the solution.