I had four on-campus interviews following a career fair: three technical and one with an HR representative. I was allowed to use any programming language. There were six questions in total.

Two questions were about implementing common functions, such as a String class constructor. One question required partitioning a list around a given element. Another question involved merging two schedules that might overlap in some parts into a single schedule. The last two questions are described below.

You're given a binary tree—not necessarily complete or proper—and you need to give each node a "friend" pointer that points to the node to its right in the tree. This node is on the same level but is not necessarily a sibling, which makes the problem a little tricky. The friend pointer of the node farthest to the right on each level should be null.

You're given two arrays of the same size filled with positive integers, and an integer 0 <= N <= 255. You need to determine whether N can be written as the sum of some number from the first array and some number from the second array.