J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 mois. J'ai passé un entretien chez Microsoft (Seattle, WA) en nov. 2018
Entretien
I had a 30 mins interview on campus. A very easy technical question with some behavior. 2-3 weeks late I heard back from them and they flew me onsite to Seattle. They covered everything including Flights and hotel accommodation. I had issues with my travel but I called them and they resolved it as soon as possible. My flight was delayed due to weather issues so I miss my connecting flight to Seattle. They booked a different route and I got to Seattle at 7 am and took an Uber to my interview at 8 am with minimal sleep. My interview experience was very positive and they got back to me pretty quick. The recruiter is very amazing and he replies to my emails under an hour. He is so amazing and helpful.
Questions d'entretien [1]
Question 1
Since I didn't sign any NDA!
1) Reverse words in a string in place
2) Longest palindrome substring
3) Length of a LinkedList with cycle
4) Serialize and deserialize a binary tree
A leetcode style test with three problems, then three interviews with different managers ( for each it was a coding problem and behavioral questions). Each interview was 1 hour long
Questions d'entretien [1]
Question 1
How do I react and handle a conflict situation at work
J'ai passé un entretien chez Microsoft (Tel Aviv-Yafo)
Entretien
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.
Questions d'entretien [1]
Question 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.
Questions d'entretien [1]
Question 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.