Skip to content
Related Articles
Get the best out of our app
Open App

Related Articles

Microsoft Interview Experience | Set 159 (On campus)

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

Round 1:

The first round consisted of two coding questions to be solved in 1 hr –

  1. Given a binary tree, print the boundary of the tree in the anti-clockwise direction. Reference:
  2. Given a 2-D array, each consisting of value 0 or 1, 0 denoting sea and 1 denoting land. Find the perimeter of the largest island.

The selection criterion was to complete at least one complete running code, with sample cases. It was a pen and paper round, and the mentors were around in case any sort of help was required. This was a fairly easy round. 13 candidates were shortlisted after this round.

Round 2:

    The interview began with a little conversation about college and subjects being taught. Then the interviewer asked me if I can code a question in graphs, I said yes. So he asked me to code the following problem-

  1. Given a directed graph and a start node, find whether it is possible to reach out to all the other nodes in the graph. After I wrote the code, he asked me to extend it to all nodes, i.e. instead of a single source, the code should output YES if all the nodes are connected to one another, else answer NO.
  2. While I was writing the code on paper, the interviewer was scanning each and every word on my resume and was asking me questions in between. He checked my all online programming handles like codechef, hackerrank etc.

    Suggestion: Do not lie on your resume, mine was verified thoroughly.

  3. Then he gave me the next problem related to trees. It was a situation based question, which on decoding was equivalent to this problem- Given a BST, delete the smallest element from the tree.
  4. The next question was an easier one. Given an array of pairs (height,coins), I was asked to find the sum of coins for a particular height.
My Personal Notes arrow_drop_up
Last Updated : 18 Dec, 2018
Like Article
Save Article
Similar Reads
Related Tutorials