Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Microsoft interview experience Real time questions & tips from candidates to crack your interview

Microsoft

5 rounds | 14 Coding
problems

Preparation

Duration: 6 months

Topics: DSA, DBMS, OOPS, OS, TOC and to some extent CN

Tip

Tip 1 : I would suggest practicing as many questions on data structures and algorithms as you can because it is the question practice that would help you in building your concepts strong. I practiced a lot of questions on InterviewBit and completed all modules of data structures and algorithms because there you can find the recent interview questions that you should know.

Tip 2 : If you have time for your interviews, I would recommend going through Leetcode as it has a good variety of questions sorted on topic wise difficulty level where you can try to solve at least 20-30 questions for each data structure and algorithm. Moreover, you should regularly participate in the weekly contests happening there so that you could know about your weak areas to improve.

Tip 3 : Along with coding you should be clear about some basic concepts of Operating systems and Databases that would help in your interviews. One more thing is that do some good research about the company's goal and vision and be prepared to ask some company-related queries that show your interest in the company.

Application process

Where: Campus

Eligibility: 6.0 CGPA

Resume tip

Tip 1 : Your Resume should consist of mainly skills, projects, and achievements. Projects would play a crucial part in your interview and you should have at least one most relevant and good project that shows how strong your concepts are in development.

Tip 2 : The most important tip is that never lie on your resume and like If you have worked upon some technology for the project part only and don't know the proper depth you could write basics only in your resume.

01

Round

Easy

Online Coding Test

Duration75 minutes

Interview date29 Mar 2020

Coding problem3

This was the coding round which consisted of three coding questions and the time limit was of 75 minutes. The platform used was **Co-Cubes**. 3 questions were asked of 2, 3 and 5 marks respectively with varying difficulty.

```
If there are multiple answers, find the smallest one. For example, if N = 35, both 30 and 40 are nearest to N, since 30 is smaller, the expected answer will be 30.
```

Problem approach

This was a very basic question that involved some rounding up mathematics and I solved this question within 10 minutes using some school maths and logic.

Problem approach

This question was already done by me earlier. So, just thought of already built logic and wrote the code. Initially, few test cases were not passed then I made some changes, and all test cases passed.

```
Try to solve this problem in O(N) time complexity and O(1) space complexity.
```

Problem approach

This was a standard linked list question and I solved it using linked list traversal by changing the pointers and deleting them according to the given condition.

02

Round

Easy

Coding Test - Pen and paper

Duration30 minutes

Interview date29 Mar 2020

Coding problem2

This was a written round and we were expected to write fully functional code, without any bugs and errors. Library functions used if any, had to be explained and if possible, code for that too (not that rigorous). Pseudocode and algorithms were also allowed. All the assumptions made had to be explained as well.

```
The first number is 1.
This is read as “One 1”.
Hence, the second number will be 11.
The second number is read as “Two 1s”.
Hence, the third number will be 21.
The third number is read as “One 2, One 1”.
Hence, the fourth number will be 1211. And so on.
The fourth term is read as “One 1, One 2, Two 1s”.
Hence, the fifth term will be 111221. And so on.
```

Problem approach

I simply checked the sequence and understood the pattern and got it within 10 minutes. I simply use a brute force approach and kind of hashing to count occurrence and explained this properly on paper.

```
Given array numbers 12, 5, 34, the largest number you can form with them is 53412. There are other possible arrangements like 51234 or 34125, but they are both less than 53412.
```

```
As the final number formed after concatenation can be very large, print it as a string.
```

Problem approach

I used sorting with the self-made comparator and wrote a properly commented code.

03

Round

Easy

Face to Face

Duration50 minutes

Interview date29 Mar 2020

Coding problem2

The interviewer was very friendly and started asking me questions by making me comfortable.

Problem approach

I gave him a stack-based approach and he was satisfied with that approach.

```
If the given polynomial equation is “5x ^ 3 + 2x ^ 3 + 6x ^ 4 + 2”. There are two terms of exponent or degree 3 and they are 5x ^ 3 and 2x ^ 3. Both these terms will get added and form 7x ^ 3, so the given polynomial will be simplified as 7x ^ 3 + 6x ^ 4 + 2. Now by arranging the expression in the decreasing order of the degrees, we will have 6x ^ 4 + 7x ^ 3 + 2 and hence the result.
```

Problem approach

I gave him 3 approaches, one with trees, one with a max heap, and finally, one with Linked lists, considering all the corner cases and continuously optimizing the code with respect to time and space complexity. He seemed happy with my approach.

04

Round

Easy

Face to Face

Duration40 minutes

Interview date30 Mar 2020

Coding problem4

This round was focused on resume and projects

Problem approach

Gave him a brief introduction to my projects with tech stack information.

Problem approach

Drawn a neat diagram for that and explained to him the structure of the project.

Problem approach

I gave him all descriptions of the work and challenges that I faced during the internship.

Problem approach

Explained to him very well with a real-life example of a dataset of flats and houses.

05

Round

Easy

HR Round

Duration30 minutes

Interview date30 Mar 2020

Coding problem3

This round was basically a mix of HR and creative design round. The interviewer wanted to check whether the candidate can think out-of-the-box with regard to any given problem and come up with unique, optimized solutions.

Problem approach

I gave him the definition of DBMS which I remembered at that time and explained him ACID properties through the example of ATM transactions.

Problem approach

Drawn diagram of both architecture and explained the working of each tier in both architectures.

Problem approach

Explained this with context to 3 tier architecture of DBMS.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

What does ROLLBACK do in DBMS?

Join the Discussion

1 reply

Similar interview experiences

SDE - Intern

3 rounds | 8 problems

Interviewed by Microsoft

1515 views

2 comments

0 upvotes

SDE - 1

1 rounds | 2 problems

Interviewed by Microsoft

5914 views

0 comments

0 upvotes

SDE - 1

4 rounds | 7 problems

Interviewed by Microsoft

400 views

0 comments

0 upvotes

SWE-1

4 rounds | 7 problems

Interviewed by Microsoft

2031 views

0 comments

0 upvotes

Companies with similar interview experiences

Software Developer

6 rounds | 12 problems

Interviewed by SAP Labs

1735 views

0 comments

0 upvotes

Software Developer

3 rounds | 3 problems

Interviewed by Mindtree

1188 views

0 comments

0 upvotes

Software Developer

3 rounds | 3 problems

Interviewed by Amazon

742 views

0 comments

0 upvotes

What's the CTC?