Candidatei-me por meio de recrutador(a). O processo levou 4 semanas. Fui entrevistado pela LinkedIn (Sunnyvale, CA) em jan. de 2015
Entrevista
HR contact me through linkedin, scheduled 2 phone interviews, pass both and move to the onsite interview, which consist of 6 back to back interviews, starting from 10am till 4pm. There are 3 technical interviews(coding skill, algorithm, system design) and 3 non-technical interviews(communication skills, lunch, and talk with the hiring manager)
Generally speaking all interview questions are not super hard and most of them are reasonable, the only thing that may affect your performance is that there's no time to rest, it's basically 6 hours back to back interview except the lunch. The lunch is lead by a senior enginner, we did a lot of chatting, which made me even more exhausted.
I'd suggest that if Linkedin can setup a 30min break time after lunch, that would help the candidates to relax and gain some stemina back because the 2 interviews after the lunch are both technical.
Fiz uma entrevista na empresa LinkedIn (Sunnyvale, CA).
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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.
Fiz uma entrevista na empresa LinkedIn (Londres, Inglaterra).
Entrevista
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.
As melhores empresas na categoria “Remuneração e benefícios” perto de você
