Me postulé a través de un reclutador. El proceso tomó más de 1 semana. Acudí a una entrevista en LinkedIn
Entrevista
Recruiter was awesome and had great communication. Did a phone screen with her and then moved on to two technical phone interviews. Both phone interviews are done in an IDE of your choice with someone watching your screen over skype. You're given 45 minutes to complete the problem and then allowed to wrap it up at home and submit it.
Passed the first telephone screening but "failed" the second. When I asked why I failed, the recruiter sent me the engineer's responds with all of these problems with my code.
Granted these problems were present in my first 45 minutes (because I was working through the problem) but my final solution had none of these problems.
It was evident that the 2nd interviewer didn't even look at my final solution. He made his judgement off of what he saw on the phone an told me to submit a final answer anyways.
Preguntas de entrevista [2]
Pregunta 1
Implement a shooting algorithm for the game of Battleship.
Acudí a una entrevista en 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.
Preguntas de entrevista [1]
Pregunta 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.
Acudí a una entrevista en 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.
Las mejores empresas en cuanto a "Remuneración y prestaciones" cerca de ti