Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Microsoft nel mese di ott 2008
Colloquio
It started with a referral from a friend. I was contacted by a recruiter and offered a phone interview, which I accepted. The phone interview took place within a week. The phone interviewer seemed to be technically capable of analyzing my answers. The phone interview questions varied between high-level design questions and low-level technical questions. Overall, she was cordial and happy to answer any questions i had.
I was contacted within a couple days with an offer for the in-person interview. Apparently, they were trying out a new interview format where they bring in 30 or so candidates at a time, all to be interviewed on the same day. The interviews were still 1:1, but all interviews were conducted simultaneously, and the interviews were conducted at 45 minute intervals, with 15 minute breaks in between. It was a little different, but it allows us to socialize with each other and relax a bit before our next interview.
After all interviews were finished, we sat through a couple product presentations, selling us on the products we might be working on. This occurred while the interviewers were making their decisions. We were told that all decisions would be made before we left, which was awesome. After the presentations, I was called out to a separate room along with a small group of other people. We were all given offers; I'm not sure about what happened to the others.
I got to meet the manager of the group I was hired for (who also happened to be one of my interviewers), and we talked about various teams that I could choose to work with. All of the recruiters were very nice and happy to help out. All of the interviewers did their best to sell their teams to me. Overall, it was a great experience.
Domande di colloquio [5]
Domanda 1
Phone interview question: Describe how you would implement the C standard library function atoi.
Phone interview question: In C, why is it considered bad form for a function to return a pointer to a stack-allocated variable? What happens if you do it anyway?
Determine whether a given binary tree is fully populated, where "fully populated" means that every internal node has exactly two children, and all terminal nodes are at the same depth.
It started with a 90-minute online assessment, followed by a technical phone screen with one engineer. The OA covered two medium-to-hard algorithm problems. For coding practice, I mainly rely on "LeetCode" to cover different topics. For company-specific interview preparation, I use "Hack2Hire", "LeetCode Discuss", and "1Point3Acres" to find any recent original questions. All of them are helpful platforms. The phone screen included one coding problem and some discussion around edge cases and time complexity.
Domande di colloquio [1]
Domanda 1
Given a list of meeting time intervals, determine if a person could attend all meetings.
Ho presentato la mia candidatura online. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Microsoft nel mese di dic 2024
Colloquio
I was invited to a technical interview with Microsoft. The interviewer started with a general question: “What happens when you type google.com into your browser?” They asked a few follow-up questions related to that.
After that, they gave me a LeetCode algorithmic question, which was at a hard level. The problem was “Integer to English Words.”
Domande di colloquio [1]
Domanda 1
1. What happens when you type google.com into your browser?
2. “Integer to English Words” – LeetCode algorithmic question
Ho sostenuto un colloquio presso Microsoft (Shanghai, Shanghai)
Colloquio
Three tech interviews + one hiring manager VO, most of questions are medium to hard leetcode questions. Ask some questions about techniques you written on the resume. But I think they care more about the match of the research and the job.
Domande di colloquio [1]
Domanda 1
Tell me about the recommendation System you made for the work.