Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Microsoft (Seattle, WA) nel mese di ott 2017
Colloquio
On-line application on Microsoft website, followed by a phone interview going through my resume and doing a puzzle, followed by an on-site interview in Seattle. Honestly one of the best experiences of my life, but unfortunately I went unprepared because I had never had a technical interview before, but it really changed my perspective regarding interviewing for software engineers. If you are preparing, using a website like leetcode and try to do as many questions as possible before the interview.
Domande di colloquio [1]
Domanda 1
During the phone interview, the puzzle they asked me was about distinguishing a marble of slightly different weight out of 9, using a scale a maximum of 2 times.
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.
Domande di colloquio [1]
Domanda 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.
Ho sostenuto un colloquio presso Microsoft (Il Cairo, )
Colloquio
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.
Domande di colloquio [1]
Domanda 1
Find the lowest difference between two numbers in a list
Ho presentato la mia candidatura tramite un selezionatore. Ho sostenuto un colloquio presso Microsoft (Tel Aviv)
Colloquio
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)
Domande di colloquio [1]
Domanda 1
hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)