The process took 1+ week. I interviewed at LinkedIn
Interview
Standard engineering interview process: initial call with recruiter, then scheduled for technical phone screen. Had call with two interviewers in the same call which made the communication pretty confusing (think one was just training to become interviewer).
I applied in-person. The process took 3 weeks. I interviewed at LinkedIn (Mountain View, CA) in Dec 2014
Interview
First round was behavioral and they just asked about how I got into CS and other standard questions about my interests.
Second round was an hour long technical interview.
Third round was two-one hour long interviews.
And fourth was just talking with the team.
Interview questions [1]
Question 1
Question Description: Write a function that, given a list of integers (both positive and negative) returns the sum of the contiguous subsequence with maximum sum. Thus, given the sequence (1, 2, -4, 1, 3, -2, 3, -1) it should return 5.
I applied through a recruiter. The process took 3 weeks. I interviewed at LinkedIn
Interview
Was contacted by a recruiter through LinkedIn (very meta) and given two weeks preparation. The interviewer I was scheduled with wasn't the one who ended up interviewing me, and instead it was someone who had a very tough time speaking English and explaining the problems. I solved both questions, but it took a long time before I would understand what he meant when trying to explain them. This chewed up a substantial chunk of the interview time (for example, it took ~5-10 minutes to even get to the collaborative online editor because I couldn't understand the letters he was pronouncing in the URL).
Interview questions [2]
Question 1
Write a function that, given a list of integers (both positive and negative) returns the sum of the contiguous subsequence with maximum sum. Thus, given the sequence (1, 2, -4, 1, 3, -2, 3, -1) it should return 5.
Write a program that takes an integer and prints out all ways to multiply smaller integers that equal the original number, without repeating sets of factors. In other words, if your output contains 4 * 3, you should not print out 3 * 4 again as that would be a repeating set. Note that this is not asking for prime factorization only. Also, you can assume that the input integers are reasonable in size; correctness is more important than efficiency.
PrintFactors(12)
12 * 1
6 * 2
4 * 3
3 * 2 * 2