Message on Whatsapp 8879355057 for DSA(OA + Interview) + Fullstack Dev Training + 1-1 Personalized Mentoring to get 10+LPA Job
0 like 0 dislike
456 views

 

in Interview-Experiences by Expert (30,360 points) | 456 views

1 Answer

0 like 0 dislike

Microsoft | SWE | Hyderabad | Mar 2022 

 

Work Experience: 1 year, 9 months - Application Developer

Position: Software Engineer at Microsoft

Location: Hyderabad, India

 

Process of Applying :

I applied on the career website many times and some of my friends referred me as well. I was approached by a recruiter on LinkedIn and called for the interview process the next day. I did not get much time to prepare since I was told to appear the next day for the interview.

Interview Process:

Round 1: Data Structure & Algorithm based + Project Discussion (1 hour)

The round started with a brief introduction, hobbies and interests.

Q1 - Given two numbers represented by two linked lists, write a function that returns the sum list. The sum list is a linked list representation of the addition of two input numbers. It is not allowed to modify the lists. Also, not allowed to use explicit extra space (Hint: Use Recursion).

Example :

Input:

  First List: 5->6->3  // represents number 563

  Second List: 8->4->2 //  represents number 842

Output

  Resultant list: 1->4->0->5  // represents number 1405

 

 

Discussed my approach with the interviewer and when he was convinced with my approach, I was told to write prod-ready code.

Q2 - Given a string, find the length of the longest substring without repeating characters.

Example 1:

Input: "abcabcbb"

Output: 3 

Explanation: The answer is "abc", with the length of 3. 

 

Example 2:

Input: "bbbbb"

Output: 1

Explanation: The answer is "b", with the length of 1.

 

I told him the two pointer approach and wrote down the code. He was convinced of the solution.

Q3 - Discussion about the current work experience, technologies involved in the current project and a quick walkthrough of my resume.

 

Round 2: Data Structure & Algorithm based + Project Discussion (1 hour)

This round started with a deep discussion about my project. The interviewer went through my resume and checked my competitive programming profiles mentioned in the resume. He asked about the last contest that I gave on Codechef and discussed some stuff about competitive programming.

Q1 - Given the first 4 terms of a sequence - 1, 11, 21, 1211….

Find the nth term.

I told him the O(N) approach. I was told to write prod-ready code. He tested it for a few cases and in the end, he was satisfied with the solution.

Q2 - Given an array of strings, group anagrams together.

Example:

Input: ["eat", "tea", "tan", "ate", "nat", "bat"],

Output:

[

  ["ate","eat","tea"],

  ["nat","tan"],

  ["bat"]

]

 

It was a pretty straight forward question.

Q3 - Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.

Example:

Input: The root of a Binary Search Tree like this:

              5

            /   \

           2     13

 

Output: The root of a Greater Tree like this:

             18

            /   \

          20     13

 

 

The answer was expected in a single pass with prod-ready code.

Round 3: Computer Science Fundamentals + Project Discussion (1 hour)

  • This round started with deep discussion about my intern project.I was asked to explain the project, the algorithms used in the project and improvements I can do in the project with the current tech skills I possess. The discussion went on for 15-20 minutes.
  • Question related to Computer Science Fundamentals :
    1.Operating System questions related to mutex-semaphore, deadlock, banker’s algorithm, Paging and Page Replacement Algorithms.
    2.ACID properties (DBMS).
    3.Then I was given a table and was asked to write SQL queries for specific conditions. Two such questions were asked.
  • Question related to Shortest Path Algorithm :
    I was given n cities and I needed to find out the shortest path of all cities from a particular city. And further, if the shortest path needed to be found out from all sources, what modifications can be done? Algorithms used in Maps App. (Dijkstra, Floyd-Warshall and A-star Search)
  • Discussion about the work and tech stack of the team for which I was being interviewed.

Round 4: Behavioral Questions  + Design Problem + Project Discussion (1 hour)

  • Again, my current project was discussed and questions were asked related to my current project to test my knowledge on load handling and design of the system. The discussion went on for 15-20 minutes.
  • Design Library Management System.
  • Behavioral Questions :
    Why Microsoft?
    Innovations you have done at your workplace apart from work?
    Handling conflicts between team members
    Reaction to poor feedback
    Deliverables for tomorrow but it requires time, handling situations like these.
    Handling failures and setbacks.
  • Discussion about Microsoft products.

Result : After 15-16 days of the last round, I got an email for selection.

**Pro-tips :

  1. The interviewers were very friendly. You should not be nervous and be confident.
  2. Adapt to follow up questions.
  3. Speak out your thoughts and logic. Start writing the code only after you have discussed the approach with the interviewer.
  4. Practice writing programs on paper so that it can work in one go in the interview.
  5. Go well prepared with the projects and skills you have mentioned in the resume.
  6. If you have strong programming profiles, do mention about it in the interview and your passion for competitive coding.
  7. If you are not able to solve any problem, you should not panic. Interviewers just want to check your approach to problem solving.
  8. Great Communication skills are always a plus point.
by Expert (30,360 points)