Solicité el puesto a través de un captador. El proceso duró 2 semanas. Acudí a una entrevista en LinkedIn (Mountain View, CA) en may 2011
Entrevista
The process began with a technical 1:1 phone screen. This part is not very difficult, they test basic algorithms and data structures knowledge. You have to code online and in real time with the interviewer using collabedit.
The onsite interview was exhausting and unnecessary long, I got there around 10 am and left at 5 pm. I was interviewed by 10 people in 5-6 sessions. The interviewers were nice in general and they tested: technical communication, algorithms, data structures, architecture/design and culture. I only failed to complete 1 of the questions but that was enough to get rejected.
Overall it seems like a good place to work at.
Preguntas de entrevista [1]
Pregunta 1
Design and code a system that can accept millions of events in real time and report the number of events for the last 10 minutes (sliding window). The system has to account for performance and concurrency.
Cakewalk of an interview. Nobody knew anything about the role or its expectations. Same questions from a question bank. Questions are available on Google search in a couple of minutes. No wrong answers.
Envié una solicitud electrónica. Acudí a una entrevista en LinkedIn (Mountain View, CA)
Entrevista
The initial communication was good and the recruiter did a good job of arranging a coding test on collabedit.
The interviewer was very unprofessional. Came late and hurried up the interview and the other person didn't turn up at all. Also the interviewer didn't know what she was working on !!!
Solicité el puesto a través de un captador. El proceso duró 3 días. Acudí a una entrevista en LinkedIn en dic 2011
Entrevista
I was contacted by a Linkedin recruiter. After having a 1:1 sessions with development leads was called for an onsite. My technical interviews I thought went reasonably well but I was declined.
Preguntas de entrevista [1]
Pregunta 1
Given a large document and a short pattern consisting of a few words (eg. W1 W2 W3), find the shortest string that has all the words in any order (for eg. W2 foo bar dog W1 cat W3 -- is a valid pattern)
