Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Microsoft (Il Cairo, ) nel mese di giu 2017
Colloquio
The process was divided into three phases. The first was a online assessment test that tested my knowledge of the company and basic questions of my field. Second phase was a video interview where I would answer questions and respond in a 30 second recorded video. It mainly asked questions regarding my behavior and personality in certain situations and how I would act accordingly. Last and final phase was a face-to-face interview with 3 employees, 2 of which are in my field and one HR employee. They asked mainly about my past experiences and technical abilities that would show whether I was a suitable fit to undergo the internship or not.
Domande di colloquio [2]
Domanda 1
Should you have a problem with a colleague, how would proceed in this situation?
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)