Microsoft | SWE | Summer 2019

Initial call from recruiter and then online coding assessment followed by on-site interviews.

Phone screen (1 hour):

• https://leetcode.com/problems/reverse-words-in-a-string
• https://leetcode.com/problems/valid-anagram

Onsite: There were 4 rounds of interviews. Each round was 45 mins long and a 15 mins long break after each round.

Round 1:

• Given an undirected graph where each node has a string value. Find if another given string can be traversed starting from any node in the graph and visiting the neighboring nodes. A node may be visited more than once but once you have visited the node label till certain index, you can't go back in that label while matching. You can only proceed from the next index.

Round 2:

• https://leetcode.com/problems/unique-paths-ii
• Design REST APIs for file sharing management system (like Dropbox or Google Drive).

Round 3:

• https://leetcode.com/problems/reverse-words-in-a-string
• https://leetcode.com/problems/two-sum
• Behavioral: how do you ramp-up on new projects, how do you manage dependencies with other teams?

Round 4:

• Design minesweeper game
• Design bit-set data structure