J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 4 semaines. J'ai passé un entretien chez LinkedIn en oct. 2012
Entretien
I was contacted for an interview through my campus. I talked with the recruiter and he made the position seem very enticing and we scheduled a technical phone interview. I had to keep rescheduling the interview since the interviewer kept missing our scheduled time, Eventually, we talked and he asked me to code up an RPN calculator through collabedit. I did pretty well and was contacted for a second phone screen. I felt this interview went pretty well too but was told after that I would not be moving on. The interviewer called slightly late and left early saying he had a meeting.
Overall, I would suggest to LinkedIn to give a little more respect to candidates who are interviewing and be generally faster with response times (was told more than 2 weeks after the phone interview that I would not be moving on).
Questions d'entretien [1]
Question 1
Code an RPN calculator with only (+, -, x, /) operations where each operation only takes in two integers as input.
J'ai passé un entretien chez LinkedIn (Sunnyvale, CA)
Entretien
Interviewed for an SDE role. The process was well-organized and the recruiters were responsive throughout. That said, the technical rounds were significantly more challenging than expected — definitely come prepared to go deep. Overall a valuable experience regardless of the outcome.
That was a real stroke of luck — when I got to the coding round and encountered a question on finding the maximum subarray sum, I had literally seen this exact problem on prachub.com a few days earlier. The interview kicked off with a recruiter screen, followed by a technical phone interview. It was intense, especially with the focus on algorithms and data structures. I also faced some behavioral questions that challenged my experience. After a final onsite round, I received an offer and happily accepted. Overall, it was tough but rewarding.
Questions d'entretien [1]
Question 1
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
J'ai passé un entretien chez LinkedIn (Londres, Angleterre)
Entretien
Overall, a good interview process and the team were very friendly during the interview process and it was very good and pleasant. Nothing in regard to negative feedback or anything as such like that.