Microsoft | L61 | Feb [Reject]

Status: 1 YOE at a well known IT firm Position: SDE-2 at Microsoft Location: Seattle Date: Jan

Recruiter reached out to me on LinkedIn in Jan and gave me a Codility coding assessment. The assignment had 3 qustions to be solved in 90 mins. Q1: Write a function such that it returns the number of ways in which we can choose a pair fo fractions from X and Y such thata the sum is 1. Ex: X = [1,1,2], Y=[3,2,3] => res = 1(1/3,2/3) X=[1,1,1], Y=[2,2,2] => res = 3 X=[1,2,3,1,2,12,8,4], Y=[5,10,15,2,4,15,10,5] => res = 10

Q2: Maximum Length of a Concatenated String with Unique Characters Q3: Debug question. Can't recall but an easy fix

Completed all questions in 50 mins.

Recrruiter reached out in a couple of days and told me that I did good in the assessment and there is an interview fair which will have 4 virtual onsite rounds of 45 mins each. Scheduled the interview in Jan.

Round 1: Design a elevator. It was an open ended question. I had to figure out which elevator should come to my floor if I have 4 things given(current capacity, max capacity, currrent floor and total number of floors). Designed an optimal solution and coded the function accordingly.

Round 2: Similar to leetcode question.

Round 3: Introduction. 2 behavioral questions about work experience. 1 coding question. Reverse the string of length k. You can have multiple whitespaces in the string. s='abcdef gh ijk' k = 3 Output = 'cbafed gh kji'

Round 4: 2 questions. Code the inorder traversal of a binary tree(recursive and iterative). Given a set of numbers, find the second max number

All 4 rounds went pretty well. I missed an edge case in round 3.

Recruiter reached out to me in a week that one team is interested but they want to do one more tech screen round. Scheduled the tech screen round in 3 days. It had 2 questions.

1. Zigzag level order traversal of a binary tree
2. It was a puzzle question. A bag has 4 balls. 2 red and 2 white. Once the dealer take out each ball, I have to guess the color. If I am right, I win 1$ and 0 if I lose. Considering this, how much money should I pay in the beginning? And what is the minimum amount that I can win?

Did the first question in 10 mins. Explained the algo and implemented it with test cases. For second question, I missed the minimum amount part. It should have been 2$ but I messed it up.

The recruiter sent a rejection mail in 3 days. Don't know where things went wrong.