I applied online. The process took 3 weeks. I interviewed at LinkedIn (Mountain View, CA)
Interview
1st call - Phone call with the Recruiter just to talk about what you've done and what currently interests you. Basically to directly communicate with you to see if you'd be a good fit for the company to want to go through the interview process with you
2nd call - Technical phone interview #1 using Collabedit. Given two questions to solve in one hour. First question was to find the lowest common ancestor given two nodes and the second question was to determine if two strings are isomorphic (there exact question can be found on this site)
3rd call - Technical phone interview #2 also using Collabedit. Given two questions to solve in one hour as well. First question was find the largest subsequence given an array that yields the largest sum. The second question was a modification of the first that required me to find the largest subsequence of the given array that yields the largest PRODUCT. Didn't complete the code for the second question in time.
Side note, recruiters were really easy to talk to and really speedy with their response.
Interview questions [1]
Question 1
Nothing really unexpected or difficult. If you put the time out to study for LinkedIn, you should be more than fine.
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.
Interview questions [1]
Question 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.
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.
Top companies for "Compensation and Benefits" near you
