Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso LinkedIn (Sunnyvale, CA) nel mese di giu 2021
Colloquio
I recently interviewed with LinkedIn for SWE Productivity Engineering team. I did around 200-225LC(easy, medium,hard). The interviewer asked me an array question and I solved it. Then he asked me a question related to BST(insert/Delete). I explained him the logic clearly and wrote the code. He was not able to understand the delete part(looks like he never did BST by himself or he didn’t even know the basic principle of BST deletion). I explained him multiple times and even with a diagram. Still he was not accepting the solution.
After the interview I googled the question and I was 100% correct and my code was perfectly fine too. Then I saw his profile on LinkedIn. It seems like he was a salesforce.com developer for 6 years and recently converted to Sr.SWE at LinkedIn. Not sure why he asked me BST without knowing the basics of it. I felt bad for missing the opportunity!#engineering #software #swe
Did anyone face this kind of situation before?
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
