Candidatei-me por meio de recrutador(a). O processo levou 2 semanas. Fui entrevistado pela LinkedIn em set. de 2014
Entrevista
I was contacted by a recruiter on LinkedIn, who later called me and informally discussed the position they were looking for and asked about my background. After this phone call, the recruiter scheduled an hour-long technical phone interview with two software engineers based on my availability, which happened to be 2 weeks after this initial phone call from the recruiter.
The technical phone screen was conducted using collabedit. First, the interviewer asked about my background and what my favorite project was that I had worked on. Then, the technical questions began. He said, depending on the time, that 2 coding questions would be asked and we had enough time for both questions plus extra time for me to ask them questions. I coded my answers in C++.
I was notified 3 days after the phone screen that they would not be moving forward with me.
Perguntas de entrevista [2]
Pergunta 1
Implement double pow(double a, int b) without using any already built-in functions (aka, don't use an already defined pow function).
Given two (dictionary) words as Strings, determine if they are isomorphic. Two words are called isomorphic if the letters in one word can be remapped to get the second word. Remapping a letter means replacing all occurrences of it with another letter while the ordering of the letters remains unchanged. No two letters may map to the same letter, but a letter may map to itself.
Example:
Given "foo", "app"; returns true
we can map 'f' -> 'a' and 'o' -> 'p'
Given "bar", "foo"; returns false
we can't map both 'a' and 'r' to 'o'
Given "turtle", "tletur"; returns true
we can map 't' -> 't', 'u' -> 'l', 'r' -> 'e', 'l' -> 'u', 'e' -'r'
Given "ab", "ca"; returns true
we can map 'a' -> 'c', 'b'
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ê
