Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Microsoft (Redmond, WA) nel mese di gen 2017
Colloquio
I was referred by a friend of mine currently working at Microsoft. I first did a 45 minute on-campus interview which consisted of one easy question plus some behaviorals. Unfortunately, Microsoft had fulfilled their hiring quota for the year, but a spot opened up in mid-December and I scheduled my on-site to be in January.
The on-site consisted of five interviews about an hour long each, with some standard data structures/algorithm questions plus one system design question. The fifth interviewer also asked some behaviorals. The algorithm questions were probably around LeetCode Medium level.
Domande di colloquio [5]
Domanda 1
Given a list of n unsorted key-value tuples which are too large to fit in memory, return the k tuples with the greatest value where n is several orders of magnitude greater than k. This list may be dispersed across multiple machines.
Given a tree of order n which is neither complete or a search tree, write a function to construct a new tree of order m in-place. Memory usage is bound to 2 times the size of the tree. The new tree must be complete, and a node A cannot be a child of another node B in the new tree if A was an ancestor of B in the old tree.
Given a list of movement commands (up, down, left, right, undo previous action), write a function that returns the final (x,y) coordinate. Followup: how would you handle other kinds of commands and undoing them? What kind of design pattern is this?
Given two very large timestamped sorted log files that do not fit in memory (possibly on different machines), merge them in timestamp order. Provide some test cases.
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.
