Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto più di una settimana. Ho sostenuto un colloquio presso LinkedIn
Colloquio
Campus recruiting.
two rounds of phone interviews. both are for an hour.
first go through your resume for like 10 - 15 minutes. then given you one to two algorithm questions.
then onsite, there will be 4 rounds of interview. two of them is about algorithm which you need to write code, and one is about system design, and one is kinda like behaviour interview. sometimes, you get two rounds of system design interviews.
basically that's it. Linkedin's kinda easy comparing to other companies, and they are hiring a lot of people.
good luck!
Domande di colloquio [1]
Domanda 1
given like +77288.100, a772sb, 2000.00.11.
return if it's a number.
you could either write a regular expression or simply go through the string.
1. it should start with "+/-" or "0-9".
2. there should only have one "." in the string.
3. all other character are "0-9"
that's it.
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
