Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso LinkedIn
Colloquio
A recruiter reached out to me a few months ago asking if I was interested in possibly pursuing an opportunity in working with LinkedIn.
Two phone screens after that, all technical and took place over a site like collabedit. The interviewers were nice, and the questions were not too hard; they get everything from a test bank.
Was invited for an on-site round after that. During the on-site round, you go through 6 interviews; two based on coding, one on technical communication, one on a project you worked on before, and one on design. Make sure you prepare for the coding section! You don't have freedom to answer the question in any way you wish; you have to go by the function headers they provide for you.
Domande di colloquio [1]
Domanda 1
Everything they ask can really just be found online. There is no real difference in difficulty between the phone and in-person sections.
Ho sostenuto un colloquio presso LinkedIn (Sunnyvale, CA)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
Ho sostenuto un colloquio presso LinkedIn (Londra, Inghilterra)
Colloquio
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.
Le migliori aziende per "stipendio e benefit" vicino a te
