J'ai postulé en ligne. Le processus a pris 2 semaines. J'ai passé un entretien chez LinkedIn
Entretien
Applied on Company website. Contacted by HR, scheduled for technical screen. Online technical screen using a collaborative editing tool. Second technical screen by phone, no on line editing.
Scheduled for 5 hour on site. senior manager for position and I had short chat about company culture, then got lunch. Then 4 sets of technical interviews with one or two people asking me questions.
Culture was very exciting to me - the people seemed very enthusiastic about the company and that they would be solving interesting problems that would make a difference in people's lives.
Questions d'entretien [1]
Question 1
The difficult portion was due to poor time management - I didn't know I was going to be asked to do two whiteboard coding problems and the interviewers had asked me to talk about successes in my career. So 40 minutes of a 60 minute session were taken up before they got to what was important. My advice is to ask interviewers politely what they need to cover in their time.
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.
Meilleures entreprises pour « Rémunération et avantages » près de chez vous
