Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Microsoft (Ogden, UT) nel mese di apr 2019
Colloquio
I interviewed with two people. With each interviewer there was a five minute personality interview followed by a ten minute whiteboard interview.
Before this on campus interview they reviewed probably 30 resumes that were submitted via our career counselor. Then 10 of us were invited to an interview preparation meeting with one of our interviewers so that we could talk about the process, the company culture, and ask questions.
Domande di colloquio [1]
Domanda 1
Write a program to take inputs of word pairs, like box lunch, box car, car stereo, stereo sound, etc
Start at a random index and output a list of pairs omitting previously used pairs.
Ho sostenuto un colloquio presso Microsoft (Tel Aviv)
Colloquio
I applied through their website with a referral, after a month or so they sent me a home exam, I think about a month after that i had 3 interviews in the same day, each one around 1:15 hours.
Domande di colloquio [1]
Domanda 1
implement a dictionary where you have set,get and setAll, all in O(1)
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
