The process was pretty smooth, and everyone was enjoyable to talk to. I had:

• Two behavioral interviews
• One job fit interview
• One Java skills interview

The job fit interview asked me to solve an algorithm problem, similar to what you would do in a Top Coder marathon match. Considering the line of work, I was immediately frustrated because I didn't understand what this would measure. However, the interviewer was really great and helpful throughout the process. I didn't do too well there. I think they just wanted to see how I thought through the problem.

Within the Java technical interview, it was a little more applicable. However, of course, I couldn't remember some topics from CSC 101, which I took 13 years ago, but I guess that is to be expected.

Overall, I felt it was a good process even though I didn't get the job. I am disappointed because I know that I could do the job and do it well.

Given a double array:

{ [ 9, 8, 6], [ 2, 3, 5], [ 3, 4, 4] }

Find the longest run counting up. A run is a consecutive row of integers counting up. So, in the example above, the longest run is {[2,2], [1,2],[0,2],[0,1],[0,0]}. You won't be able to solve it in the amount of time that was given, but I think they just want to see how you think.

What is the Java Heap Space?

Explain the Chain of Responsibility Pattern and name two places where this shows up in the Java language.

Design a REST controller to take in two cities and return the distance between them as the output. (Follow-up question: How would you get the information to tell what type of device it is coming from?)