La procedura ha richiesto 5 settimane. Ho sostenuto un colloquio presso LinkedIn
Colloquio
Had two phone interviews. The first phone interview had 2 questions to solve. The second phone interview had one question but did add extensions to the problem later on. I did well and was invited onsite. Onsite was a typical 6hr interview with 1hr/round. 2 coding rounds, 1 design round , 1 round with host manager, 1 technical communication round and 1 lunch. Solve atleast 2 coding questions per coding round. Be fast and make sure the code is right to the most granular level. All the questions were from Leetcode medium level. Solve them as many as possible. I had a hiccup in one coding round and ran out of time to put the complete code for the second question and that was a good enough reason not to offer.
Ho sostenuto un colloquio presso LinkedIn (San Francisco, CA)
Colloquio
The interview process started with a screening round featuring one LeetCode medium problem and an SQL challenge. This was followed by a comprehensive onsite with five rounds: a LeetCode coding challenge, an SQL assessment, a system design interview, a hiring manager conversation to evaluate cultural fit, and finally a team matching phase to find the right team.
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.