Candidatei-me por meio de uma faculdade ou universidade. O processo levou 2 meses. Fui entrevistado pela Microsoft (Praga) em dez. de 2014
Entrevista
First stage was a phone interview - 30 minutes about my background and some logic puzzles.
Second stage was an interview with an employee from Microsoft at my university.
Third stage was a series of technical interviews in Microsoft office in Prague, 45 min each.
Perguntas de entrevista [1]
Pergunta 1
The questions were about implementing modified BFS, some manipulation on arrays, designing a server architecture, creating a specific binary tree for a SDK (it was supposed to be generic).
The hiring process consists of a HackerRank home exam, followed by three technical interviews covering LeetCode-style problems and system architecture. Once this is done, you will have a final HR interview.
Perguntas de entrevista [1]
Pergunta 1
I had a technical interview where I was asked to solve the classic 'Climbing Stairs' problem (LeetCode #70), which is a dynamic programming question based on the Fibonacci sequence.
Fiz uma entrevista na empresa Microsoft (Cairo, ).
Entrevista
One HR interview, then two problem-solving interviews (beginer level) on HackerRank. You can choose the best programming language for you to use in solving problems. You should think out loud to enable your interviewer to understand how you would think to solve the problem.
Perguntas de entrevista [1]
Pergunta 1
Find the lowest difference between two numbers in a list
Candidatei-me por meio de recrutador(a). Fiz uma entrevista na empresa Microsoft (Tel Aviv-Yafo).
Entrevista
hr reached to me on linkedIn and sent me Take-home assignment hosted on HackerRank. I had about 10 days to complete. The test included 1 medium/easy question and one hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)
Perguntas de entrevista [1]
Pergunta 1
hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)
