J'ai postulé via un recruteur. Le processus a pris 3 semaines. J'ai passé un entretien chez LinkedIn
Entretien
Was contacted by a recruiter through LinkedIn (very meta) and given two weeks preparation. The interviewer I was scheduled with wasn't the one who ended up interviewing me, and instead it was someone who had a very tough time speaking English and explaining the problems. I solved both questions, but it took a long time before I would understand what he meant when trying to explain them. This chewed up a substantial chunk of the interview time (for example, it took ~5-10 minutes to even get to the collaborative online editor because I couldn't understand the letters he was pronouncing in the URL).
Questions d'entretien [2]
Question 1
Write a function that, given a list of integers (both positive and negative) returns the sum of the contiguous subsequence with maximum sum. Thus, given the sequence (1, 2, -4, 1, 3, -2, 3, -1) it should return 5.
Write a program that takes an integer and prints out all ways to multiply smaller integers that equal the original number, without repeating sets of factors. In other words, if your output contains 4 * 3, you should not print out 3 * 4 again as that would be a repeating set. Note that this is not asking for prime factorization only. Also, you can assume that the input integers are reasonable in size; correctness is more important than efficiency.
PrintFactors(12)
12 * 1
6 * 2
4 * 3
3 * 2 * 2
J'ai passé un entretien chez LinkedIn (Sunnyvale, CA)
Entretien
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.
Questions d'entretien [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.
J'ai passé un entretien chez LinkedIn (Londres, Angleterre)
Entretien
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.
Meilleures entreprises pour « Rémunération et avantages » près de chez vous
