I dropped my resume on the school's career website and got a call from a recruiter a week later, asking if I had time for an on-campus interview. I had interviews that Friday.

At the end of the first interview, I was asked if I had time for another. I stayed and had the second.

At the end of the second interview, I was asked if I had time for a third one. I came back later that day to finish my third and fourth interviews.

The first and second interviews were technical and lasted for one hour each. The third interview was half behavioral, and the interviewer asked me a simple design problem. The last interview was completely behavioral; I just chatted with the recruiter.

All interviewers were nice and helpful. They gave me hints when I got stuck.

I received an offer the following week. I was amazed by their efficiency. This is the fastest recruiting process I have ever experienced.

1. Find a substring in a string.

2. A board contains black and white cells. Find the largest size rectangle with all white cells.

3. Find the subarray in an array of ints with the largest sum.

4. Given a process tree, where each process has a pointer to its parent, how can you kill a process? Killing a process means to kill it and all of its descendants.