Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Microsoft (Bucarest, )
Colloquio
The interview process had 3 rounds
First, it was a technical test with 2 coding problems
Second, it was a phone interview for 30 minutes. For some reason, I haven't received one.
Third, it was a 3-round long interview with 45 minutes per round and a 15-minute break. The first round, I had to solve a coding problem. After I was done, my problem was slightly modified and I was asked how to solve the modified version. The second round, I was asked about the projects from my CV and I was asked a data structure question (How to design a smart elevator). Third round included OOP basic questions. It was quite exhausting.
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)