It was a 45-minute phone interview with a software engineer.

He asked two questions about general coding.

The questions were not too difficult, but there were some corner cases that made it hard to be completely correct on the first attempt.

The time was also a little bit tight.

The first question is to find the largest and second largest value at each level of a binary tree. You don't need to return all values; just print them out.

The second question is to return a value from an array with a probability proportional to its weight within the array. For example, in an array [4, 5, 6], return 4 with probability 4/15, 5 with 5/15, and 6 with 6/15. You are given a function that returns a random real number between 0 and 1.