The interview process was technical, and I did not sign an NDA.

The interviewers were friendly and cooperative.

It looks like very interesting work there.

There were two rounds of interviews:

• The first was for an hour with a couple of interviewers.
• The second was for three hours with six interviewers.

Overall, it was a nice experience.

1. You have a tree (not a BST). Find the third maximum element.

2. Given an array of numbers, nums, return an array of numbers, products, where products[i] is the product of all nums[j] where j != i.

Input: [1, 2, 3, 4, 5] Output: [(2*3*4*5), (1*3*4*5), (1*2*4*5), (1*2*3*5), (1*2*3*4)] = [120, 60, 40, 30, 24]

You must do this in O(N) time.