2 algorithm questions (already discussed on glass door); think recursion for one, and how pinterest might implement its infinite-scrolling boards for the other.
Sigiloso
Some recursion; recognize when recursive calls are O(2^n) at base case and smaller when optimized; write some code on whiteboard -- very straightforward, but it was worth practicing.