Me postulé a través de un reclutador. Acudí a una entrevista en LinkedIn (Mountain View, CA) en ago 2014
Entrevista
2 telephonic followed by 6 in-house algo/design/coding interviews.
- How to find if nodes in graph are exactly 1/2/3 edges apart. how would you distribute graph across machines.
- Given set of characters and a string, find smallest substring which contains all characters.
- Implement a delayed scheduler for jobs using pthread apis (mutex/cond_var)
- You have bunch of numbers coming in, and a given a window size, how would you save numbers so that you can return number if present in window and provide average for current window.
- Manager round: You are given bunch of machines with services running on them, how would you improve things. very vague design talk.
- Reverse words in a string.
- Implement decimal to roman and vice versa.
Preguntas de entrevista [1]
Pregunta 1
2 person (one senior / one junior) interview panel system at LinkedIn is weird. It is interviewee's responsibility to manage time during interview.
Acudí a una entrevista en LinkedIn (Sunnyvale, CA)
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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.
Acudí a una entrevista en LinkedIn (Londres, Inglaterra)
Entrevista
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.
Las mejores empresas en cuanto a "Remuneración y prestaciones" cerca de ti
