I applied online. I interviewed at Microsoft (Pekín, Pekín) in Apr 2017
Interview
First I submit the application online. After about 2 months I received an email which aim to arrange an interview with me. 2 days later went the interview. Unfortunately I didn't pass the first round. But the interviewer is kind and I learnt a lot during the preparation.
Interview questions [1]
Question 1
The question is to implement the pick k nearest items from a database. Give some acceleration tips for the situation.
Stage 1: Take-Home Assessment – A 1-hour coding assignment consisting of two technical questions (one Easy and one Medium).
Stage 2: Virtual Interview Day – A Zoom-based interview day comprising three consecutive interviews.
Star method completely end to end with 3 interviews in the same day. It was online and then we were split into rooms. You mess up one and you mess up all
Maximum subarray questions+ oops + dbms. find the contiguous (connected) sequence of numbers within a 1D array that has the largest possible sum, a classic computer science problem solvable efficiently with Kadane's Algorithm (Dynamic Programming/Greedy) in O(N) time, handling positive, negative numbers, and returning just the sum. Variations exist, like finding the maximum product or handling 2D arrays,
Interview questions [1]
Question 1
find the contiguous (connected) sequence of numbers within a 1D array that has the largest possible sum, a classic computer science problem solvable efficiently with Kadane's Algorithm (Dynamic Programming/Greedy) in O(N) time, handling positive, negative numbers, and returning just the sum. Variations exist, like finding the maximum product or handling 2D arrays,
