Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso LinkedIn
Colloquio
Sent my CV through their web site. Got a reply a few days later and after a short HR interview they scheduled the first tech phone interview for the next week.
I did quite well in the first interview and they scheduled a second phone interview. This time I could barely hear my two interviews and had a HARD time to understand the questions and the feedback. I took around 40 minutes to solve the first question and the solution was quite good. Then I had 20 min to solve the next question. I did it but there was a bug and I could not fix it. 2 days later they told me there was no strong fit and that was the end of the line for me.
Domande di colloquio [1]
Domanda 1
In the first interview: they asked me to implement a pow(base, exp) function. I did a linear solution and they asked me to improve it (time complexity). There's a logN solution for this problem.
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
